Inefficiency of Games with Social Context

• Published in: Theory of computing systems Vol. 57; no. 3; pp. 782 - 804
• Main Authors: Anagnostopoulos, Aris, Becchetti, Luca, de Keijzer, Bart, Schäfer, Guido
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.10.2015; Springer Nature B.V
• Subjects: Algorithms; Altruism; Analysis; Computation; Computer networks; Computer Science; Congestion; Equilibrium; Friendship; Game theory; Games; Players; Scheduling; Social structure; Society; Studies; Theory of Computation; Traffic flow; Price Auction; Altruistic Behavior; Congestion Game; Strategy Profile; Delay Function
• ISSN: 1432-4350; 1433-0490
• DOI: 10.1007/s00224-014-9602-4

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 might be drastic for generalized second price auctions.