Pursuit–Evasion Games with incomplete information in discrete time

Pursuit–Evasion Games with incomplete information in discrete time

0.00 Avg rating0 Votes
Article ID: iaor200971579
Country: Germany
Volume: 38
Issue: 3
Start Page Number: 367
End Page Number: 376
Publication Date: Nov 2009
Journal: International Journal of Game Theory
Authors:
Keywords: pursuit
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 ϵ-optimal strategies for both players that are ϵ-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.

Reviews

Required fields are marked *. Your email address will not be published.