The robust price of anarchy of altruistic games

  • Authors:

  • Po-An Chen;Bart de Keijzer;David Kempe;Guido Schäfer

  • Affiliations:

  • Department of Computer Science, University of Southern California;Algorithms, Combinatorics and Optimization, CWI, Amsterdam, The Netherlands;Department of Computer Science, University of Southern California;Algorithms, Combinatorics and Optimization, CWI, Amsterdam, The Netherlands

  • Venue:
  • WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the inefficiency of equilibria for several classes of games when players are (partially) altruistic. We model altruistic behavior by assuming that player i 's perceived cost is a convex combination of 1−α i times his direct cost and α i times the social cost. Tuning the parameters α i allows smooth interpolation between purely selfish and purely altruistic behavior. Within this framework, we study altruistic extensions of cost-sharing games, utility games, and linear congestion games. Our main contribution is an adaptation of Roughgarden's smoothness notion to altruistic extensions of games. We show that this extension captures the essential properties to determine the robust price of anarchy of these games, and use it to derive mostly tight bounds.