Pursuit-evasion games with incomplete information in discrete time
From MaRDI portal
(Redirected from Publication:532679)
Abstract: Pursuit-Evasion Games (in discrete time) are stochastic games with nonnegative daily payoffs, with the final payoff being the cumulative sum of payoffs during the game. We show that such games admit a value even in the presence of incomplete information and that this value is uniform, i.e. there are epsilon-optimal strategies for both players that are epsilon-optimal in any long enough prefix of the game. We give an example to demonstrate that nonnegativity is essential and expand the results to leavable games.
Recommendations
Cites work
- scientific article; zbMATH DE number 3128726 (Why is no real title available?)
- scientific article; zbMATH DE number 3876959 (Why is no real title available?)
- scientific article; zbMATH DE number 3993574 (Why is no real title available?)
- scientific article; zbMATH DE number 3296964 (Why is no real title available?)
- An operator solution of stochastic games
- Borel determinacy
- Dynamic noncooperative game theory
- Existence of Saddle Points in Differential Games
- On Some Differential Games
- Stochastic Games
Cited in
(7)- Infinite sequential games with perfect but incomplete information
- scientific article; zbMATH DE number 686943 (Why is no real title available?)
- Cops and invisible robbers: the cost of drunkenness
- Optimal strategies in a pursuit problem with incomplete information
- scientific article; zbMATH DE number 7601675 (Why is no real title available?)
- Some Sufficient Conditions for Multi-Player Pursuit-Evasion Games with Continuous and Discrete Observations
- scientific article; zbMATH DE number 1944084 (Why is no real title available?)
This page was built for publication: Pursuit-evasion games with incomplete information in discrete time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q532679)