Brief announcement: Graphical congestion games with linear latencies

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2008, Pages 194-196

  Bilò, Vittorio ^a   Flammini, Michele ^b   Fanelli, Angelo ^b   Moscardelli, Luca ^b  

^a UNIVERSITY OF SALENTO   (Italy)

^b UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

Algorithmic game theory; Congestion games; Nash equilibrium; Price of anarch chy; Price of stability; Social knowledg

Indexed keywords

COSTS; TELECOMMUNICATION NETWORKS;

ALGORITHMIC GAME THEORY; CONGESTION GAMES; NASH EQUILIBRIUM; PRICE OF ANARCH-CHY; PRICE OF STABILITY; SOCIAL KNOWLEDG;

GAME THEORY;

EID: 57349088104     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1378533.1378571     Document Type: Conference Paper

References (10)

1. R. Beier, A. Czumaj, P. Krysta, and B. Vocking. Computing Equilibria for Congestion Games with (Im)perfect Information. In Proc. of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), ACM Press, pp. 746-755, 2004.
2. G. Christodoulou and E. Koutsoupias. The Price of Anarchy of Finite Congestion Games. In Proc. of the 37th Annual ACM Symposium on Theory of Computing (STOC), ACM Press, pp. 67-73, 2005.
3. G. Christodoulou and E. Koutsoupias. On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games. In Proc, of the 13th Annual European Symposium on Algorithms (ESA), LNCS 3669, Springer, pp. 59-70, 2005.
4. A. Fabrikant, C. H. Papadimitriou, and K. Talwar. The Complexhy of Pure Nash Equilibria. In Proc. of the 36th Annual ACM Symposium on Theory of Computing (STOC), ACM Press, pp. 604-612, 2004.
5. M. Gairing, B. Monien, and K. Tiemann. Selfish Routing with Incomplete Information. In Proc. of the 17th Annual ACM Symposium, on Parallel Algorithms (SPAA), ACM Press, pp. 203-212, 2005.
6. J. C. Harsanyi. Games with Incomplete Information Played by Bayesian Players, I, II, III. Management Science, 14:159-182, 320-332, 468-502, 1967.
7. Elias Koutsoupias, Panagiota N. Panagopoulou and Paul G. Spirakis. Selfish Load Balancing Under Partial Knowledge In Proc. of 32nd International Symposium, on Mathematical Foundations of Computer Science (MFCS), LNCS 4708, 609-620, 2007.
8. M. J, Kearns, M. L. Littman, and S. P. Singh. Graphical Models for Game Theory. In Proc. of the 17th Conference in Uncertainty in Artificial Intelligence (UAI), pp. 253-260, 2001.
9. nd ACM Symposium on Theory of Computing (STOC) (2000), pp. 163-170.
10. R. W. Rosenthal. A Class of Games Possessing Pure-Strategy Nash Equilibria. International Journal of Game Theory, 2:65-67, 1973.