A Markov chain game with dynamic information

DOI10.1007/BF00940310MaRDI QIDQ1093571zbMATH OpenFDO

Authors Geert Jan Olsder, George P. Papavassilopoulos

Publication date 1988

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00940310

zbMATH Keywords

dynamic information

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40) 2-person games (91A05) Positional games (pursuit and evasion, etc.) (91A24)

Review text

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.

Recommendations

• About when to use the searchlight
• Dynamic Search Games
• Discrete games with incomplete information
• A basic searchlight game
• The Value of Markov Chain Games with Lack of Information on One Side

Cites work

• Dynamic noncooperative game theory
• scientific article; zbMATH DE number 3916057 (Why is no real title available?)
• Optimal mixed strategies in a dynamic game
• Rabbit and hunter game: Two discrete stochastic formulations

Cited in

(4)

• About when to use the searchlight
• Infiltration games on arbitrary graphs
• A basic searchlight game
• Markov games with incomplete information

This page was built for publication: A Markov chain game with dynamic information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1093571)