How hard is it to find extreme Nash equilibria in network congestion games?
Year of publication: |
2008
|
---|---|
Authors: | Gassner, Elisabeth ; Hatzl, Johannes ; Krumke, Sven O. ; Sperber, Heike ; Woeginger, Gerhard J. |
Published in: |
Internet and network economics : 4th international workshop, WINE 2008, Shanghai, China, December 17-20, 2008 ; proceedings. - Berlin : Springer, ISBN 3-540-92184-2. - 2008, p. 82-93
|
Subject: | Unternehmensnetzwerk | Business network | Engpass | Bottleneck | Nichtkooperatives Spiel | Noncooperative game | Nash-Gleichgewicht | Nash equilibrium | Algorithmus | Algorithm | Theorie | Theory |
-
A logarithmic approximation for polymatroid congestion games
Harks, Tobias, (2016)
-
Approximate Nash equilibria in large nonconvex aggregative games
Liu, Kang, (2023)
-
Nodewise Decay in Two-Way Flow Nash Network : A Study of Network Congestion
Charoensook, Banchongsan, (2017)
- More ...
-
Epstein, Leah, (2011)
-
Interval scheduling on related machines
Krumke, Sven O., (2011)
-
Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
Krumke, Sven O., (2011)
- More ...