Partition Equilibrium Always Exists in Resource Selection Games
From MaRDI portal
Recommendations
- Partition equilibrium always exists in resource selection games
- On the existence of Nash equilibrium in games with resource-bounded players
- Equilibrium in non-partitioning strategies
- Stable partitions for games with non-transferable utility and externalities
- Necessary and sufficient conditions for balancedness in partitioning games
- Symmetric subgame-perfect equilibria in resource allocation
- Pure Nash Equilibrium in a Capacitated Selfish Resource Allocation Game
- Existence of equilibrium and separation in generalized games
- Equilibrium computation in resource allocation games
- Rationalizable partition-confirmed equilibrium
Cites work
- scientific article; zbMATH DE number 3139273 (Why is no real title available?)
- A class of games possessing pure-strategy Nash equilibria
- Atomic Congestion Games Among Coalitions
- Coordination mechanisms for selfish scheduling
- Network structure and strong equilibrium in route selection games.
- Non-clairvoyant scheduling games
- Partition equilibrium (extended abstract)
- Potential games
- Selfish load balancing and atomic congestion games
- Selfish routing with atomic players
- Strong Price of Anarchy for Machine Load Balancing
- Strong equilibrium in congestion games
- The effect of collusion in congestion games
- The price of routing unsplittable flow
Cited in
(5)
This page was built for publication: Partition Equilibrium Always Exists in Resource Selection Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3162506)