Pursuit-Evasion Games with incomplete information in discrete time

Ori Gurel-Gurevich*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

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 e{open}-optimal strategies for both players that are e{open}-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.

Original languageAmerican English
Pages (from-to)367-376
Number of pages10
JournalInternational Journal of Game Theory
Volume38
Issue number3
DOIs
StatePublished - 2009
Externally publishedYes

Keywords

  • Incomplete information
  • Nonnegative payoffs
  • Pursuit-Evasion Games
  • Recursive games
  • Zero-sum stochastic games

Fingerprint

Dive into the research topics of 'Pursuit-Evasion Games with incomplete information in discrete time'. Together they form a unique fingerprint.

Cite this