Computation of equilibria and the price of anarchy in bottleneck congestion games
Year of publication: |
2014
|
---|---|
Authors: | Werth, T. L. ; Sperber, Herbert ; Krumke, Sven O. |
Published in: |
Central European journal of operations research : CEJOR ; official journal of the Austrian, Croatian, Czech, Hungarian, Slovakian and Slovenian OR Societies. - Berlin : Springer, ISSN 1435-246X, ZDB-ID 1178875-6. - Vol. 22.2014, 4, p. 687-712
|
Subject: | Network bottleneck game | Unsplittable flow | Optimal equilibria | Complexity | Price of stability | Price of anarchy | Engpass | Bottleneck | Nash-Gleichgewicht | Nash equilibrium | Gleichgewichtsmodell | Equilibrium model | Nichtkooperatives Spiel | Noncooperative game | Gleichgewichtstheorie | Equilibrium theory | Spieltheorie | Game theory |
-
The inefficiency of Nash and subgame perfect equilibria for network routing
Correa, José, (2019)
-
Computing approximate equilibria in weighted congestion games via best-responses
Giannakopoulos, Yiannis, (2022)
-
Efficiency of correlation in a bottleneck game
Rivera, Thomas J., (2018)
- More ...
-
Atomic routing in a deterministic queuing model
Werth, T. L., (2014)
-
Interval scheduling on related machines
Krumke, Sven O., (2011)
-
Epstein, Leah, (2011)
- More ...