Low energy and mutually distant sampling
Journal of Algorithms
ACM Computing Surveys (CSUR)
Near-optimal network design with selfish agents
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Competitive facility location: the Voronoi game
Theoretical Computer Science
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
The Isolation Game: A Game of Distances
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
The one-round Voronoi game replayed
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Nash equilibria in Voronoi games on graphs
ESA'07 Proceedings of the 15th annual European conference on Algorithms
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |
We study the performances of Nash equilibria in isolation games, a class of competitive location games recently introduced in Zhao et al. (Proc. of the 19th International Symposium on Algorithms and Computation (ISAAC), pp. 148---159, 2008). For all the cases in which the existence of Nash equilibria has been shown, we give tight or asymptotically tight bounds on the prices of anarchy and stability under the two classical social functions mostly investigated in the scientific literature, namely, the minimum utility per player and the sum of the players' utilities. Moreover, we prove that the convergence to Nash equilibria is not guaranteed in some of the not yet analyzed cases.