Inefficiency of Games with Social Context

  • Aris Anagnostopoulos
  • Luca Becchetti
  • Bart de Keijzer
  • Guido Schäfer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8146)


The study of other-regarding player behavior such as altruism and spite in games has recently received quite some attention in the algorithmic game theory literature. Already for very simple models, it has been shown that altruistic behavior can actually be harmful for society in the sense that the price of anarchy may increase as the players become more altruistic. In this paper, we study the severity of this phenomenon for more realistic settings in which there is a complex underlying social structure, causing the players to direct their altruistic and spiteful behavior in a refined player-specific sense (depending, for example, on friendships that exist among the players). Our findings show that the increase in the price of anarchy is modest for congestion games and minsum scheduling games, whereas it is drastic for generalized second price auctions.


Altruistic Behavior Price Auction Congestion Game Pure Nash Equilibrium Related Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ashlagi, I., Krysta, P., Tennenholtz, M.: Social context games. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 675–683. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  2. 2.
    Bilò, V., Celi, A., Flammini, M., Gallotti, V.: Social context congestion games. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol. 6796, pp. 282–293. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  3. 3.
    Bilò, V., Fanelli, A., Flammini, M., Moscardelli, L.: Graphical congestion games. Algorithmica 61(2), 274–297 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Brandt, F., Sandholm, T., Shoham, Y.: Spiteful bidding in sealed-bid auctions. In: Proc. 20th Intl. Joint Conf. on Artifical Intelligence, pp. 1207–1214 (2007)Google Scholar
  5. 5.
    Buehler, R., et al.: The price of civil society. In: Chen, N., Elkind, E., Koutsoupias, E. (eds.) WINE 2011. LNCS, vol. 7090, pp. 375–382. Springer, Heidelberg (2011)Google Scholar
  6. 6.
    Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M.: On the efficiency of equilibria in generalized second price auctions. In: Proc. 12th Conf. on Electronic Commerce, pp. 81–90 (2011)Google Scholar
  7. 7.
    Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M., Papaioannou, E.: The impact of altruism on the efficiency of atomic congestion games. In: Wirsing, M., Hofmann, M., Rauschmayer, A. (eds.) TGC 2010, LNCS, vol. 6084, pp. 172–188. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  8. 8.
    Chen, P.A., de Keijzer, B., Kempe, D., Schäfer, G.: The robust price of anarchy of altruistic games. In: Chen, N., Elkind, E., Koutsoupias, E. (eds.) WINE 2011. LNCS, vol. 7090, pp. 383–390. Springer, Heidelberg (2011)Google Scholar
  9. 9.
    Chen, P.A., Kempe, D.: Altruism, selfishness, and spite in traffic routing. In: Proc. 9th Conf. on Electronic Commerce, pp. 140–149 (2008)Google Scholar
  10. 10.
    Christodoulou, G., Koutsoupias, E.: On the price of anarchy and stability of correlated equilibria of linear congestion games. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 59–70. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  11. 11.
    Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proc. 37th Symp. on the Theory of Computing, pp. 67–73 (2005)Google Scholar
  12. 12.
    Christodoulou, G., Mirrokni, V.S., Sidiropoulos, A.: Convergence and approximation in potential games. Theoretical Computer Science 438, 13–27 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Cole, R., Correa, J.R., Gkatzelis, V., Mirrokni, V., Olver, N.: Inner product spaces for minsum coordination mechanisms. In: Proc. 43rd Symp. on the Theory of Computing, pp. 539–548 (2011)Google Scholar
  14. 14.
    Elias, J., Martignon, F., Avrachenkov, K., Neglia, G.: Socially-aware network design games. In: Proc. 29th Conf. on Computer Communications, pp. 41–45 (2010)Google Scholar
  15. 15.
    Fehr, E., Schmidt, K.M.: The Economics of Fairness, Reciprocity and Altruism: Experimental Evidence and New Theories. Handbook on the Economics of Giving, Reciprocity and Altruism, vol. 1, ch. 8, pp. 615–691 (2006)Google Scholar
  16. 16.
    Fotakis, D., Gkatzelis, V., Kaporis, A.C., Spirakis, P.G.: The impact of social ignorance on weighted congestion games. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 316–327. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  17. 17.
    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)CrossRefGoogle Scholar
  18. 18.
    Hoefer, M., Skopalik, A.: Stability and convergence in selfish scheduling with altruistic agents. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 616–622. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  19. 19.
    Hoefer, M., Skopalik, A.: Social context in potential games. In: Goldberg, P.W. (ed.) WINE 2012. LNCS, vol. 7695, pp. 364–377. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  20. 20.
    Hoeksma, R., Uetz, M.: The price of anarchy for minsum related machine scheduling. In: Solis-Oba, R., Persiano, G. (eds.) WAOA 2011. LNCS, vol. 7164, pp. 261–273. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  21. 21.
    Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, p. 404. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  22. 22.
    Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: Proc. 41st Symp. on the Theory of Computing, pp. 513–522 (2009)Google Scholar
  23. 23.
    Roughgarden, T.: The price of anarchy in games of incomplete information. In: Proc. 13th Conf. on Electronic Commerce, pp. 862–879 (2012)Google Scholar
  24. 24.
    Syrgkanis, V.: Bayesian games and the smoothness framework. CoRR abs/1203.5155 (2012)Google Scholar
  25. 25.
    Syrgkanis, V., Tardos, É.: Composable and efficient mechanisms. In: Proc. 45th Symp. on the Theory of Computing (2013)Google Scholar
  26. 26.
    Young, H.P.: Strategic Learning and its Limits (1995)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Aris Anagnostopoulos
    • 1
  • Luca Becchetti
    • 1
  • Bart de Keijzer
    • 2
  • Guido Schäfer
    • 2
  1. 1.Sapienza University of RomeItaly
  2. 2.CWI and VU University AmsterdamThe Netherlands

Personalised recommendations