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 load balancing on related machines. We also give tight bounds for $k$-strong equilibria, where the size of a deviating coalition is at most $k$, for unrelated machines
AbstractIn the resource allocation game introduced by Koutsoupias and Papadimitriou, n jobs of diffe...
We consider the computational complexity of coalitional solution concepts in scenarios related to lo...
In the resource allocation game introduced by Koutsoupias and Papadimitriou, n jobs of different wei...
As defined by Aumann in 1959, a strong equilibrium is a Nash equilibrium that is resilient to deviat...
Abstract. We consider the solution concept of stochastic stability, and propose the price of stochas...
We study the inefficiency of equilibrium outcomes in Bottleneck Congestion games. These games model ...
This paper deals with two games defined upon well known generalizations of max cut. We study the exi...
Abstract. This paper deals with two games defined upon well known generalizations of max cut. We stu...
In this paper, we study two models of resource allocation games: the classical load-balancing game a...
We study strong stability of Nash equilibria in load balancing games of m (m ≥ 2) identical servers,...
We study the inefficiency of equilibria for various classes of games when players are (partially) al...
We study network games in which each player wishes to connect his source and sink, and the cost of e...
We investigate the price of anarchy of a load balancing game with $K$ dispatchers. The service rates...
We investigate the price of anarchy of a load balancing game with K dispatchers. The service rates a...
We study strong equilibria in network creation games. These form a classical and well-studied class ...
AbstractIn the resource allocation game introduced by Koutsoupias and Papadimitriou, n jobs of diffe...
We consider the computational complexity of coalitional solution concepts in scenarios related to lo...
In the resource allocation game introduced by Koutsoupias and Papadimitriou, n jobs of different wei...
As defined by Aumann in 1959, a strong equilibrium is a Nash equilibrium that is resilient to deviat...
Abstract. We consider the solution concept of stochastic stability, and propose the price of stochas...
We study the inefficiency of equilibrium outcomes in Bottleneck Congestion games. These games model ...
This paper deals with two games defined upon well known generalizations of max cut. We study the exi...
Abstract. This paper deals with two games defined upon well known generalizations of max cut. We stu...
In this paper, we study two models of resource allocation games: the classical load-balancing game a...
We study strong stability of Nash equilibria in load balancing games of m (m ≥ 2) identical servers,...
We study the inefficiency of equilibria for various classes of games when players are (partially) al...
We study network games in which each player wishes to connect his source and sink, and the cost of e...
We investigate the price of anarchy of a load balancing game with $K$ dispatchers. The service rates...
We investigate the price of anarchy of a load balancing game with K dispatchers. The service rates a...
We study strong equilibria in network creation games. These form a classical and well-studied class ...
AbstractIn the resource allocation game introduced by Koutsoupias and Papadimitriou, n jobs of diffe...
We consider the computational complexity of coalitional solution concepts in scenarios related to lo...
In the resource allocation game introduced by Koutsoupias and Papadimitriou, n jobs of different wei...