Partition Equilibrium Always Exists in Resource Selection Games

DOI10.1007/978-3-642-16170-4_5zbMath1253.91091OpenAlexW3138198563MaRDI QIDQ3162506

Elliot Anshelevich, Bugra Caskurlu, Ameya Hate

Publication date: 19 October 2010

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16170-4_5

Mathematics Subject Classification ID

Noncooperative games (91A10) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (1)

Coordinating oligopolistic players in unrelated machine scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Selfish load balancing and atomic congestion games
• Coordination mechanisms for selfish scheduling
• Strong equilibrium in congestion games
• Network structure and strong equilibrium in route selection games.
• Potential games
• A class of games possessing pure-strategy Nash equilibria
• The effect of collusion in congestion games
• Atomic Congestion Games Among Coalitions
• Partition Equilibrium
• Non-clairvoyant Scheduling Games
• Strong Price of Anarchy for Machine Load Balancing
• The Price of Routing Unsplittable Flow

This page was built for publication: Partition Equilibrium Always Exists in Resource Selection Games