The price of malice in linear congestion games

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

Volumn 5385 LNCS, Issue , 2008, Pages 118-125

  Roth, Aaron ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY DEGREES; CONGESTION GAMES; LINEAR CONGESTION GAMES; NASH EQUILIBRIUM; PARALLEL LINKS; SOCIAL COSTS; TIGHT BOUNDS; UTILITY FUNCTIONS;

GAME THEORY; INTERNET; WINE;

COSTS;

EID: 58849135332     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92185-1_20     Document Type: Conference Paper

References (16)

1. Awerbuch, B., Kleinberg, R.: Adaptive routing with end-to-end feedback: Distributed learning and geometric approaches. In: Proceedings of the 36th ACM Symposium on Theory of Computing (STOC) (2004)
2. Babaioff, M., Kleinberg, R., Papadimitriou, C.H.: Congestion games with malicious players. In: EC 2007: Proceedings of the 8th ACM conference on Electronic commerce, pp. 103-112. ACM, New York (2007)
3. Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)
4. Blum, A., Even-Dar, E., Ligett, K.: Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games. In: PODC 2006: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, pp. 45-52. ACM, New York (2006)
5. Blum, A., Hajiaghayi, M., Ligett, K., Roth, A.: Regret minimization and the price of total anarchy. In: STOC 2008: Proceedings of the fortieth annual ACM symposium on Theory of computing (2008)
6. Brandt, F., Sandholm, T., Shoham, Y.: Spiteful bidding in sealed-bid auctions. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI) (2007)
7. Chung, C., Ligett, K., Pruhs, K., Roth, A.: The price of stochastic anarchy. In: Monien, B., Schroeder, U.-P. (eds.) SAGT 2008. LNCS, vol. 4997, pp. 303-314. Springer, Heidelberg (2008)
8. Kalai, A., Vempala, S.: Efficient algorithms for on-line optimization. In: Proceedings of the The 16th Annual Conference on Learning Theory, pp. 26-40 (2003)
9. Karakostas, G., Viglas, A.: Equilibria for networks with malicious users. Math. Program. 110(3), 591-613 (2007)
10. Kleinberg, R.: Anytime algorithms for multi-armed bandit problems. In: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pp. 928-936. ACM Press, New York (2006)
11. Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: Proceedings of 16th STACS, pp. 404-413 (1999)
12. Littlestone, N., Warmuth, M.K.: The weighted majority algorithm. Inf. Comput. 108(2), 212-261 (1994)
13. McMahan, B., Blum, A.: Online geometric optimization in the bandit setting against an adaptive adversary. In: Shawe-Taylor, J., Singer, Y. (eds.) COLT 2004. LNCS, vol. 3120, pp. 109-123. Springer, Heidelberg (2004)
14. Morgan, J., Steiglitz, K., Reis, G.: The spite motive and equilibrium behavior in auctions. Contributions to Economic Analysis & Policy 2(1), 1102-1127 (2003)
15. Moscibroda, T., Schmid, S., Wattenhofer, R.: When selfish meets evil: byzantine players in a virus inoculation game. In: PODC 2006: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, pp. 35-44. ACM, New York (2006)
16. Roughgarden, T., Tardos, É.: How bad is selfish routing? J. ACM 49(2), 236-259 (2002)