The inefficiency of Nash and subgame perfect equilibria for network routing
Year of publication: |
2019
|
---|---|
Authors: | Correa, José ; Jong, Jasper de ; Keijzer, Bart de ; Uetz, Marc |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 44.2019, 4, p. 1286-1303
|
Subject: | Nash and subgame perfect equilibrium | price of anarchy | congestion games | network routung | Nash-Gleichgewicht | Nash equilibrium | Spieltheorie | Game theory | Gleichgewichtstheorie | Equilibrium theory | Nichtkooperatives Spiel | Noncooperative game | Engpass | Bottleneck | Netzwerk | Network | Gleichgewichtsmodell | Equilibrium model |
-
Computation of equilibria and the price of anarchy in bottleneck congestion games
Werth, T. L., (2014)
-
Computing approximate equilibria in weighted congestion games via best-responses
Giannakopoulos, Yiannis, (2022)
-
Network topology and equilibrium existence in weighted network congestion games
Milchtaich, Igal, (2015)
- More ...
-
The quality of equilibria for set packing and throughput scheduling games
Jong, Jasper de, (2020)
-
The sequential price of anarchy for affine congestion games with few players
Jong, Jasper de, (2019)
-
Apt, Krzysztof R., (2017)
- More ...