A Markov chain game with dynamic information (Q1093571): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3691448 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dynamic noncooperative game theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rabbit and hunter game: Two discrete stochastic formulations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal mixed strategies in a dynamic game / rank | |||
Normal rank |
Latest revision as of 11:58, 18 June 2024
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