Malicious Bayesian congestion games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5426 LNCS, Issue , 2009, Pages 119-132

  Gairing, Martin ^a  

^a INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; BAYESIAN NETWORKS; COSTS; TELECOMMUNICATION NETWORKS;

BAYESIAN; BAYESIAN NASH EQUILIBRIUM; CONGESTION GAMES; LATENCY FUNCTIONS; NP-COMPLETE; SOCIAL COSTS; TIGHT BOUNDS; WORST CASE;

GAME THEORY;

EID: 60349125017     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-93980-1_10     Document Type: Conference Paper

References (23)

1. Ackermann, H., Röglin, H., Vöcking, B.: On the Impact of Combinatorial Structure on Congestion Games. In: Proc. of the 47th Annual Symposium on Foundations of Computer Science (FOCS 2006), pp. 613-622 (2006)
2. Aland, S., Dumrauf, D., Gairing, M., Monien, B., Schoppmann, F.: Exact price of anarchy for polynomial congestion games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 218-229. Springer, Heidelberg (2006)
3. Awerbuch, B., Azar, Y., Epstein, A.: The Price of Routing Unsplittable Flow. In: Proc. of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 57-66 (2005)
4. Babaioff, M., Kleinberg, R., Papadimitriou, C.H.: Congestion Games with Malicious Players. In: Proc. of the 8th ACM Conference on Electronic Commerce (EC 2007), pp. 103-112 (2007)
5. Christodoulou, G., Koutsoupias, E.: The Price of Anarchy of Finite Congestion Games. In: Proc. of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 67-73 (2005)
6. Conitzer, V., Sandholm, T.: New Complexity Results about Nash Equilibria. In: Proc. of 18th International Joint Conference on Artificial Intelligence (IJCAI 2003), pp. 765-771 (2003)
7. Dunkel, J., Schulz, A.S.: On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 62-73. Springer, Heidelberg (2006)
8. Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The Complexity of Pure Nash Equilibria. In: Proc. of the 36th Annual ACM Symposium on Theory of Computing (STOC 2004), pp. 604-612 (2004)
9. Fotakis, D.A., Kontogiannis, S.C., Spirakis, P.G.: Symmetry in network congestion games: Pure equilibria and anarchy cost. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 161-175. Springer, Heidelberg (2006)
10. Gairing, M., Monien, B., Tiemann, K.: Selfish Routing with Incomplete Information. Theory of Computing Systems 42(1), 91-130 (2008)
11. Gairing, M., Schoppmann, F.: Total Latency in Singleton Congestion Games. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 381-387. Springer, Heidelberg (2007)
12. Goemans, M.X., Mirrokni, V., Vetta, A.: Sink Equilibria and Convergence. In: Proc. of the 46th Annual Symposium on Foundations of Computer Science (FOCS 2005), pp. 142-154 (2005)
13. Gottlob, G., Greco, G., Mancini, T.: Complexity of Pure Equilibria in Bayesian Games. In: Proc. of 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 1294-1299 (2007)
14. Harsanyi, J.C.: Games with Incomplete Information Played by Bayesian Players, I, II, III. Management Science 14, 159-182, 320-332, 468-502 (1967)
15. Karakostas, G., Viglas, A.: Equilibria for networks with malicious users. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, pp. 696-704. Springer, Heidelberg (2003)
16. Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404-413. Springer, Heidelberg (1999)
17. Libman, L., Orda, A.: Atomic Resource Sharing in Noncooperative Networks. Telecommunication Systems 17(4), 385-409 (2001)
18. Milchtaich, I.: Congestion Games with Player-Specific Payoff Functions. Games and Economic Behavior 13(1), 111-124 (1996)
19. Moscibroda, T., Schmid, S., Wattenhofer, R.: When Selfish Meets Evil: Byzantine Players in a Virus Inoculation Game. In: Proc. of the 25th Annual ACM Symposium on Principles of Distributed Computing (PODC 2006), pp. 35-44 (2006)
20. Nash, J.F.: Non-Cooperative Games. Annals of Mathematics 54(2), 286-295 (1951)
21. Rosenthal, R.W.: A Class of Games Possessing Pure-Strategy Nash Equilibria. International Journal of Game Theory 2, 65-67 (1973)
22. Roughgarden, T., Tardos, É.: How Bad Is Selfish Routing? Journal of the ACM 49(2), 236-259 (2002)
23. Tovey, C.A.: A Simplified NP-complete Satisfiability Problem. Discrete Applied Mathematics 8, 85-89 (1984)