Partition equilibrium always exists in resource selection games
type: Item
instance of: scholarly article
title: Partition equilibrium always exists in resource selection games
zbMATH Open document ID: 1291.91009
author: Elliot Anshelevich
author: Bugra Caskurlu
author: Ameya Hate
published in: Theory of Computing Systems
publication date: 2013-10-21T00:00:00Z
Mathematics Subject Classification ID: 91A10
Mathematics Subject Classification ID: 91B32
zbMATH DE Number: 6217443
zbMATH Keywords: strong equilibrium
zbMATH Keywords: Nash equilibrium
zbMATH Keywords: load balancing
zbMATH Keywords: resource selection
MaRDI profile type: Publication
full work available at URL: s00224-013-9463-2
OpenAlex ID: W2018930168
cites work: Q3254691
cites work: The Price of Routing Unsplittable Flow
cites work: Non-clairvoyant scheduling games
cites work: Partition Equilibrium
cites work: Strong Price of Anarchy for Machine Load Balancing
cites work: Atomic congestion games among coalitions
cites work: The effect of collusion in congestion games
cites work: Strong equilibrium in congestion games
cites work: Network structure and strong equilibrium in route selection games.
cites work: Coordination mechanisms for selfish scheduling
cites work: Potential games
cites work: A class of games possessing pure-strategy Nash equilibria
cites work: Selfish routing with atomic players
cites work: Selfish load balancing and atomic congestion games
DOI: 10.1007/S00224-013-9463-2
description: scientific article; zbMATH DE number 6217443