Altruism in atomic congestion games

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

Volumn 5757 LNCS, Issue , 2009, Pages 179-189

  Hoefer, Martin ^a   Skopalik, Alexander ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALTRUISTIC BEHAVIOR; ARBITRARY DELAYS; CONGESTION GAMES; DELAY FUNCTION; HARDNESS RESULT; LINEAR COMBINATIONS; NASH EQUILIBRIA; NASH EQUILIBRIUM; NP-HARD; POLYNOMIAL-TIME ALGORITHMS; SOCIAL COST; STABLE STATE; SYMMETRIC NETWORK;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; TELECOMMUNICATION NETWORKS;

GAME THEORY;

EID: 70350401905     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04128-0_16     Document Type: Conference Paper

References (21)

1. Ackermann, H., Röglin, H., Vöcking, B.: On the impact of combinatorial structure on congestion games. J. ACM, 55(6) (2008)
2. Ackermann, H., Skopalik, A.: On the Complexity of Pure Nash Equilibria in Player- Specific Network Congestion Games. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 419-430. Springer, Heidelberg (2007)
3. Babaioff, M., Kleinberg, R., Papadimitriou, C.: Congestion games with malicious players. In: Proc 8th Conference on Electronic Commerce (EC 2007), pp. 103-112 (2007)
4. Chen, P.-A., Kempe, D.: Altruism, selfishness, and spite in traffic routing. In: Proc. 9th Conference on Electronic Commerce (EC 2008), pp. 140-149 (2008)
5. Eshel, I., Samuelson, L., Shaked, A.: Altruists, egoists and hooligans in a local interaction model. American Economic Review 88(1), 157-179 (1998)
6. Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria. In: Proc 36th Symposium on Theory of Computing (STOC 2004), pp. 604-612 (2004)
7. Fehr, E., Schmidt, K.: A theory of fairness, competition, and cooperation. The Quarterly Journal of Economics 114, 817-868 (1999)
8. Gairing, M.: Malicious bayesian congestion games. In: Bampis, E., Skutella, M. (eds.) WAOA 2008. LNCS, vol. 5426, pp. 119-132. Springer, Heidelberg (2009)
9. Gairing, M., Monien, B., Tiemann, K.: Routing (Un-) splittable flow in games with player-specific linear latency functions. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 501-512. Springer, Heidelberg (2006)
10. Gintis, H., Bowles, S., Boyd, R., Fehr, E.: Moral Sentiments and Material Interests: The Foundations of Cooperation in Economic Life. MIT Press, Cambridge (2005)
11. Ieong, S., McGrew, R., Nudelman, E., Shoham, Y., Sun, Q.: Fast and compact: A simple class of congestion games. In: Proc 20th Conf Artificial Intelligence (AAAI 2005), pp. 489-494 (2005)
12. Kaporis, A., Spirakis, P.: Stackelberg games: The price of optimum. In: Encyclopedia of Algorithms. Springer, Heidelberg (2008)
13. Kaporis, A., Spirakis, P.: The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions. Theoretical Computer Science 410(8-10), 745-755 (2009)
14. Karakostas, G., Viglas, A.: Equilibria for networks with malicious users. Mathematical Programming 110(3), 591-613 (2007)
15. Ledyard, J.: Public goods: A survey of experimental resesarch. In: Kagel, J., Roth, A. (eds.) Handbook of Experimental Economics, pp. 111-194. Princeton University Press, Princeton (1997)
16. Levine, D.: Modeling altruism and spitefulness in experiments. Review of Economic Dynamics 1, 593-622 (1998)
17. Milchtaich, I.: Congestion games with player-specific payoff functions. Games and Economic Behavior 13(1), 111-124 (1996)
18. Moscibroda, T., Schmid, S., Wattenhofer, R.: When selfish meets evil: Byzantine players in a virus inoculation game. In: Proc. 25th Symposium on Principles of Distributed Computing (PODC 2006), pp. 35-44 (2006)
19. Nisan, N., Tardos, É., Roughgarden, T., Vazirani, V. (eds.): Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)
20. Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. Intl. J. Game Theory 2, 65-67 (1973)
21. Tovey, C.: A simplified NP-complete satisfiability problem. Discrete Applied Mathematics 8, 85-89 (1984)