Existence and complexity of approximate equilibria in weighted congestion games
Year of publication: |
2023
|
---|---|
Authors: | Christodoulou, Giorgos ; Gairing, Martin ; Giannakopoulos, Yiannis ; Poças, Diogo ; Waldmann, Clara |
Published in: |
Mathematics of operations research. - Hanover, Md. : INFORMS, ISSN 1526-5471, ZDB-ID 2004273-5. - Vol. 48.2023, 1, p. 583-602
|
Subject: | approximate equilibria | atomic congestion games | existence of equilibria | hardness of equilibria | pure Nash equilibria | weighted congestion games | Nash-Gleichgewicht | Nash equilibrium | Engpass | Bottleneck | Spieltheorie | Game theory | Gleichgewichtstheorie | Equilibrium theory | Nichtkooperatives Spiel | Noncooperative game | Gleichgewichtsmodell | Equilibrium model |
-
Computing approximate equilibria in weighted congestion games via best-responses
Giannakopoulos, Yiannis, (2022)
-
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 undirected two disjoint shortest paths problem
Gottschau, Marinus, (2019)
-
The competitive pickup and delivery orienteering problem for balancing car-sharing systems
Martin, Layla, (2021)
-
Developing the Silver Economy and Related Government Resources for Seniors : A Position Paper
Agosti, Maristella, (2022)
- More ...