Social Context Games

  • Itai Ashlagi
  • Piotr Krysta
  • Moshe Tennenholtz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5385)


We introduce social context games. A social context game is defined by an underlying game in strategic form, and a social context consisting of an undirected graph of neighborhood among players and aggregation functions. The players and strategies in a social context game are as in the underlying game, while the players’ utilities in a social context game are computed from their payoffs in the underlying game based on the graph of neighborhood and the aggregation functions. Examples of social context games are ranking games and coalitional congestion games. In this paper we consider resource selection games as the underlying games, and four basic social contexts. An important property of resource selection games is the existence of pure strategy equilibrium. We study the existence of pure strategy Nash equilibrium in the corresponding social context games. We also show that the social context games possessing pure strategy Nash equilibria are not potential games, and therefore are distinguished from congestion games.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Altman, A., Tennenholtz, M.: Quantifying incentive compatibility of ranking systems. In: Proc. of AAAI 2006 (2006)Google Scholar
  2. 2.
    Brandt, F., Fischer, F., Shoham, Y.: On strictly competitive multi-player games. In: AAAI 2006, pp. 605–612 (2006)Google Scholar
  3. 3.
    Fotakis, D., Kontogiannis, S.C., Spirakis, P.G.: Atomic congestion games among coalitions. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 572–583. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  4. 4.
    Hayrapetyan, A., Tardos, E., Wexler, T.: The effect of collusion in congestion games. In: STOC 2006, pp. 89–98 (2006)Google Scholar
  5. 5.
    Kuniavsky, S., Smorodinsky, R.: Coalitional Congestion Games. Technical report, Technion, Israel (2007)Google Scholar
  6. 6.
    Monderer, D., Shapley, L.S.: Potential games. Games and Economic Behavior 14, 124–143 (1996)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Penn, M., Polukarov, M., Tennenholtz, M.: Asychronous congestion games. In: AAMAS 2008 (2008)Google Scholar
  8. 8.
    Rosenthal, R.W.: A class of games possessing pure-strategy nash equilibria. International Journal of Game Theory 2, 65–67 (1973)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Itai Ashlagi
    • 1
  • Piotr Krysta
    • 2
  • Moshe Tennenholtz
    • 3
    • 4
  1. 1.Harvard Business SchoolHarvard UniversityUSA
  2. 2.Computer Science Dept.University of LiverpoolUK
  3. 3.Industrial Engineering & ManagementTechnionIsrael
  4. 4.Microsoft Israel R&D Center 

Personalised recommendations