On the complexity of pure Nash equilibria in player-specific network congestion games
Year of publication: |
2007
|
---|---|
Authors: | Ackermann, Heiner ; Skopalik, Alexander |
Published in: |
Internet and network economics : third international workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007 ; proceedings. - Berlin : Springer, ISBN 3-540-77104-2. - 2007, p. 419-430
|
Subject: | Telekommunikationsnetz | Telecommunications network | Engpass | Bottleneck | Spieltheorie | Game theory | Internet | Nash-Gleichgewicht | Nash equilibrium | Theorie | Theory |
-
Who should pay for forwarding packets?
Ackermann, Heiner, (2007)
-
Networking games : network forming games and games on networks
Mazalov, Vladimir V., (2019)
-
On the performance of congestion games for optimum satisfiability problems
Giannakos, Aristotelis, (2007)
- More ...
-
Hoefer, Martin, (2008)
-
Stability and convergence in selfish scheduling with altruistic agents
Hoefer, Martin, (2009)
-
Hiring secretaries over time : the benefit of concurrent employment
Disser, Yann, (2020)
- More ...