The isolation game: a game of distances (Q1034611): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q268604
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Anna Jaśkiewicz / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2009.06.036 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2098040367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive facility location: the Voronoi game / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-round Voronoi game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nash Equilibria in Voronoi Games on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive spatial models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive Location Models: A Framework and Bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-round Voronoi game replayed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium points in <i>n</i> -person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low Energy and Mutually Distant Sampling / rank
 
Normal rank

Latest revision as of 03: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
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references