A Markov chain game with dynamic information
type: Item
instance of: scholarly article
title: A Markov chain game with dynamic information
zbMATH Open document ID: 0628.90097
DOI: 10.1007/BF00940310
published in: Journal of Optimization Theory and Applications
publication date: 1988-01-01T00:00:00Z
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.
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 91A24
Mathematics Subject Classification ID: 90C40
zbMATH DE Number: 4023063
zbMATH Keywords: dynamic information
author: Geert Jan Olsder
author: George P. Papavassilopoulos
MaRDI profile type: Publication
cites work: Q3691448
cites work: Dynamic noncooperative game theory
cites work: Rabbit and hunter game: Two discrete stochastic formulations
cites work: Optimal mixed strategies in a dynamic game
description: scientific article; zbMATH DE number 4023063