The isolation game: a game of distances (Q1034611): Difference between revisions
From MaRDI portal
Latest revision as of 02:59, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The isolation game: a game of distances |
scientific article |
Statements
The isolation game: a game of distances (English)
0 references
6 November 2009
0 references
The authors study the so-called isolation game, in which each player's objective is to place himself as far away as possible from other players in a bounded space. The goal is to examine the existence of Nash equilibria for these games with different farness measures. In particular, they prove that equilibria always exist when the players use the nearest-neighbor or total distance measures and the underlying space is symmetric. However, it is NP-hard to find whether Nash equilibria exist, when (a) the space is asymmetric or (b) slightly more sophisticated measures are used in a symmetric case.
0 references
algorithmic game theory
0 references
Nash equilibrium
0 references
computational complexity
0 references