Achieving target equilibria in network routing games without knowing the latency functions
Year of publication: |
2019
|
---|---|
Authors: | Bhaskar, Umang ; Ligett, Katrina ; Schulman, Leonard J. ; Swamy, Chaitanya |
Published in: |
Games and economic behavior. - Amsterdam : Elsevier, ISSN 0899-8256, ZDB-ID 1002944-8. - Vol. 118.2019, p. 533-569
|
Subject: | Ellipsoid algorithm | Network flows | Query complexity | Routing games | Stackelberg routing | Tolls | Tourenplanung | Vehicle routing problem | Spieltheorie | Game theory | Algorithmus | Algorithm | Duopol | Duopoly | Netzwerk | Network | Nash-Gleichgewicht | Nash equilibrium |
-
Setting Cournot versus Lyapunov games stability conditions and equilibrium point properties
Clempner, Julio B., (2015)
-
A note on social learning in non-atomic routing games
Giordano, Francesco, (2023)
-
Social learning in nonatomic routing games
Macault, Emilien, (2022)
- More ...
-
A Stackelberg strategy for routing flow over time
Bhaskar, Umang, (2015)
-
On the uniqueness of equilibrium in atomic splittable routing games
Bhaskar, Umang, (2015)
-
The Vector Partition Problem for Convex Objective Functions
Onn, Shmuel, (2001)
- More ...