Abstract
We study the effect of combining selfishness and altruism in atomic congestion games. We allow players to be partially altruistic and partially selfish and determine the impact of this behavior on the overall system performance. Surprisingly, our results indicate that, in general, by allowing players to be (even partially) altruistic, the overall system performance deteriorates. Instead, for the class of symmetric load balancing games, a balance between selfish and altruistic behavior improves system performance to optimality.
This work is partially supported by the European Union under IST FET Integrated Project FP6-015964 AEOLUS and Cost Action IC0602 ”Algorithmic Decision Theory”, and by a ”Caratheodory” basic research grant from the University of Patras.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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)
Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 57–66 (2005)
Bilò, V., Caragiannis, I., Fanelli, A., Flammini, M., Kaklamanis, C., Monaco, G., Moscardelli, L.: Game-theoretic approaches to optimization problems in communication networks. In: Graphs and Algorithms in Communication Networks, pp. 241–263. Springer, Heidelberg (2009)
Caragiannis, I., Flammini, M., Kaklamanis, C., Kanellopoulos, P., Moscardelli, L.: Tight bounds for selfish and greedy load balancing. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006, Part I. LNCS, vol. 4051, pp. 311–322. Springer, Heidelberg (2006)
Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Taxes for linear atomic congestion games. ACM Transactions on Algorithms (to appear)
Chen, P.-A., Kempe, D.: Altruism, selfishness and spite in traffic routing. In: Proceedings of the 9th ACM Conference on Electronic Commerce (EC 2008), pp. 140–149 (2008)
Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 67–73 (2005)
Fotakis, D., Spirakis, P.: Cost-balancing tolls for atomic network congestion games. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 179–190. Springer, Heidelberg (2007)
Hoefer, M., Skopalik, A.: Altruism in atomic congestion games. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 179–189. Springer, Heidelberg (2009)
Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404–413. Springer, Heidelberg (1999)
Lücking, T., Mavronicolas, M., Monien, B., Rode, M.: A new model for selfish routing. Theoretical Computer Science 406(2), 187–206 (2008)
Papadimitriou, C.: Algorithms, games and the internet. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC 2001), pp. 749–753 (2001)
Rosenthal, R.: A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory 2, 65–67 (1973)
Suri, S., Tóth, C., Zhou, Y.: Selfish load balancing and atomic congestion games. Algorithmica 47(1), 79–96 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M., Papaioannou, E. (2010). The Impact of Altruism on the Efficiency of Atomic Congestion Games. In: Wirsing, M., Hofmann, M., Rauschmayer, A. (eds) Trustworthly Global Computing. TGC 2010. Lecture Notes in Computer Science, vol 6084. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15640-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-15640-3_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15639-7
Online ISBN: 978-3-642-15640-3
eBook Packages: Computer ScienceComputer Science (R0)