Partition equilibrium always exists in resource selection games
From MaRDI portal
Publication:372982
DOI10.1007/s00224-013-9463-2zbMath1291.91009MaRDI QIDQ372982
Elliot Anshelevich, Bugra Caskurlu, Ameya Hate
Publication date: 21 October 2013
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-013-9463-2
91A10: Noncooperative games
91B32: Resource and cost allocation (including fair division, apportionment, etc.)
Related Items
On existence of equilibrium under social coalition structures, On singleton congestion games with resilience against collusion
Cites Work
- Unnamed Item
- Unnamed Item
- Non-clairvoyant scheduling games
- 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
- Partition Equilibrium
- Atomic congestion games among coalitions
- Strong Price of Anarchy for Machine Load Balancing
- The Price of Routing Unsplittable Flow