Mediated Equilibria in Load-Balancing Games
JR Davis, D Liben-Nowell, A Sharp… - International Workshop on …, 2009 - Springer
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 all …
a strategy; a mediator forms a mediated equilibrium if delegating is a best response for all …
On the price of mediation
M Bradonjic, G Ercal-Ozkaya, A Meyerson… - Proceedings of the 10th …, 2009 - dl.acm.org
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 of a …
of Nash equilibria. In contrast to previous work focusing on the possible benefits of a …
The effect of malice on the social optimum in linear load balancing games
D Chakrabarty, C Karande, A Sangwan - arXiv preprint arXiv:0910.2655, 2009 - arxiv.org
In this note we consider the following problem to study the effect of malicious players on the
social optimum in load balancing games: Consider two players SOC and MAL controlling (1 …
social optimum in load balancing games: Consider two players SOC and MAL controlling (1 …
On existence and properties of approximate pure Nash equilibria in bandwidth allocation games
In bandwidth allocation games (BAGs), the strategy of a player consists of various demands
on different resources. The player's utility is at most the sum of these demands, provided …
on different resources. The player's utility is at most the sum of these demands, provided …
Tight bounds for selfish and greedy load balancing
We study the load balancing problem in the context of a set of clients each wishing to run a
job on a server selected among a subset of permissible servers for the particular client. We …
job on a server selected among a subset of permissible servers for the particular client. We …
The impact of selfish behavior in load balancing games
To what extent does the structure of the players' strategy space influence the efficiency of
decentralized solutions in congestion games? In this work, we investigate whether better …
decentralized solutions in congestion games? In this work, we investigate whether better …
On the inefficiency of equilibria in linear bottleneck congestion games
B de Keijzer, G Schäfer, OA Telelis - … 2010, Athens, Greece, October 18-20 …, 2010 - Springer
We study the inefficiency of equilibrium outcomes in bottleneck congestion games. These
games model situations in which strategic players compete for a limited number of facilities …
games model situations in which strategic players compete for a limited number of facilities …
The strong price of anarchy of linear bottleneck congestion games
We study the inefficiency of equilibrium outcomes in Bottleneck Congestion games. These
games model situations in which strategic players compete for a limited number of facilities …
games model situations in which strategic players compete for a limited number of facilities …
Nash social welfare in selfish and online load balancing
In load-balancing problems there is a set of clients, each wishing to select a resource from a
set of permissible ones to execute a certain task. Each resource has a latency function …
set of permissible ones to execute a certain task. Each resource has a latency function …
The complexity of equilibria in cost sharing games
V Syrgkanis - Internet and Network Economics: 6th International …, 2010 - Springer
Abstract We study Congestion Games with non-increasing cost functions (Cost Sharing
Games) from a complexity perspective and resolve their computational hardness, which has …
Games) from a complexity perspective and resolve their computational hardness, which has …