Characterization of transport optimizers via graphs and applications to Stackelberg–Cournot–Nash equilibria
OPEN ACCESS
Loading...
Author / Producer
Date
2025-03
Publication Type
Journal Article
ETH Bibliography
yes
Citations
Altmetric
OPEN ACCESS
Data
Rights / License
Abstract
We introduce graphs associated to transport problems between discrete marginals, that allow to characterize the set of all optimizers given one primal optimizer. In particular, we establish that connectivity of those graphs is a necessary and sufficient condition for uniqueness of the dual optimizers. Moreover, we provide an algorithm that can efficiently compute the dual optimizer that is the limit, as the regularization parameter goes to zero, of the dual entropic optimizers. Our results find an application in a Stackelberg-Cournot-Nash game, for which we obtain existence and characterization of the equilibria.
Permanent link
Publication status
published
External links
Editor
Book title
Journal / series
Volume
19 (1)
Pages / Article No.
67 - 99
Publisher
Springer
Event
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Optimal transport; Connected graphs; Entropic regularization; Stackelberg-Cournot-Nash equilibria
Organisational unit
09727 - Acciaio, Beatrice / Acciaio, Beatrice