A Markov chain game with dynamic information (Q1093571)

From MaRDI portal
Revision as of 11:58, 18 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Markov chain game with dynamic information
scientific article

    Statements

    A Markov chain game with dynamic information (English)
    0 references
    1988
    0 references
    Two players, not knowing each other's position, move in a domain and can flash a searchlight. The game terminates when one player is caught within the area illuminated by the flash of the other. However, if this first player is not in this area, then the other player has disclosed his position to the former one, who may be able to exploit this information. The game is considered on a finite state space and in discrete time.
    0 references
    dynamic information
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references