Inefficiency of games with social context

DOI10.1007/s00224-014-9602-4zbMath1327.91022OpenAlexW2126670486WikidataQ116754394 ScholiaQ116754394MaRDI QIDQ904696

Luca Becchetti, Bart de Keijzer, Guido Schäfer, Aris Anagnostopoulos

Publication date: 13 January 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/24019

Mathematics Subject Classification ID

Noncooperative games (91A10) Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (5)

Additively separable hedonic games with social context ⋮ Scheduling games with rank-based utilities ⋮ On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games ⋮ Internalization of social cost in congestion games ⋮ On the robustness of the approximate price of anarchy in generalized congestion games

Cites Work

• Unnamed Item
• Unnamed Item
• Social context congestion games
• Convergence and approximation in potential games
• A game theoretic analysis of network design with socially-aware users
• Graphical congestion games
• The impact of social ignorance on weighted congestion games
• Selfish load balancing and atomic congestion games
• Bounding the inefficiency of outcomes in generalized second price auctions
• The Price of Anarchy for Minsum Related Machine Scheduling
• Bounding the Inefficiency of Altruism through Social Contribution Games
• Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost
• The price of anarchy of finite congestion games
• Tight Bounds for Selfish and Greedy Load Balancing
• Altruism in Atomic Congestion Games
• Inner product spaces for MinSum coordination mechanisms
• Composable and efficient mechanisms

This page was built for publication: Inefficiency of games with social context