Sciweavers

10 search results - page 1 / 2
» Mediated Equilibria in Load-Balancing Games
Sort
View
WINE
2009
Springer
157views Economy» more  WINE 2009»
13 years 11 months ago
Mediated Equilibria in Load-Balancing Games
Mediators are third parties to whom the players in a game can delegate the task of choosing a strategy; a mediator forms a mediated equilibrium if delegating is a best response for...
Joshua R. Davis, David Liben-Nowell, Alexa Sharp, ...
ICALP
2007
Springer
13 years 11 months ago
Strong Price of Anarchy for Machine Load Balancing
As defined by Aumann in 1959, a strong equilibrium is a Nash equilibrium that is resilient to deviations by coalitions. We give tight bounds on the strong price of anarchy for loa...
Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olon...
SIGECOM
2009
ACM
102views ECommerce» more  SIGECOM 2009»
13 years 11 months ago
On the price of mediation
We study the relationship between the social cost of correlated equilibria and the social cost of Nash equilibria. In contrast to previous work focusing on the possible benefits ...
Milan Bradonjic, Gunes Ercal-Ozkaya, Adam Meyerson...
IPTPS
2004
Springer
13 years 10 months ago
Uncoordinated Load Balancing and Congestion Games in P2P Systems
In P2P systems, users often have many choices of peers from whom to download their data. Each user cares primarily about its own response time, which depends on how many other use...
Subhash Suri, Csaba D. Tóth, Yunhong Zhou
SAGT
2010
Springer
181views Game Theory» more  SAGT 2010»
13 years 3 months ago
On the Complexity of Pareto-optimal Nash and Strong Equilibria
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
Martin Hoefer, Alexander Skopalik