Computing approximate equilibria in weighted congestion games via best-responses
Year of publication: |
2022
|
---|---|
Authors: | Giannakopoulos, Yiannis ; Noarov, Georgy ; Schulz, Andreas S. |
Published in: |
Mathematics of operations research. - Hanover, Md. : INFORMS, ISSN 1526-5471, ZDB-ID 2004273-5. - Vol. 47.2022, 1, p. 643-664
|
Subject: | approximate equilibria | atomic congestion games | computation of equilibria | potential games | price of anarchy | Engpass | Bottleneck | Nash-Gleichgewicht | Nash equilibrium | Spieltheorie | Game theory | Gleichgewichtsmodell | Equilibrium model | Nichtkooperatives Spiel | Noncooperative game | Gleichgewichtstheorie | Equilibrium theory |
-
Existence and complexity of approximate equilibria in weighted congestion games
Christodoulou, Giorgos, (2023)
-
Computation of equilibria and the price of anarchy in bottleneck congestion games
Werth, T. L., (2014)
-
The inefficiency of Nash and subgame perfect equilibria for network routing
Correa, José, (2019)
- More ...
-
The Pareto frontier of inefficiency in mechanism design
Filos-Ratsikas, Aris, (2022)
-
Existence and complexity of approximate equilibria in weighted congestion games
Christodoulou, Giorgos, (2023)
-
A geometric approach to the price of anarchy in nonatomic congestion games
Correa, José R., (2008)
- More ...