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 | Spieltheorie | Game theory | Nash-Gleichgewicht | Nash equilibrium | Engpass | Bottleneck | Nichtkooperatives Spiel | Noncooperative game |
-
Existence and complexity of approximate equilibria in weighted congestion games
Christodoulou, Giorgos, (2023)
-
Internalization of social cost in congestion games
Milchtaich, Igal, (2021)
-
Nash equilibria in two-resource congestion games with player-specific payoff functions
Khanchouche, Fatima, (2024)
- 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)
-
On the complexity of pure-strategy nash equilibria in congestion and local-effect games
Dunkel, Juliane, (2008)
- More ...