Pursuit-Evasion Games with Incomplete Information in Discrete Time

Details Pursuit-Evasion Games with Incomplete Information in Discrete Time Pursuit-Evasion Games with Incomplete Information in Discrete Time

2007-08-19

arxiv.org/abs/0708.2556v1

Mathematics

Probability

14 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Pursuit-Evasion Games with Incomplete Information in Discrete Time does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pursuit-Evasion Games with Incomplete Information in Discrete Time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pursuit-Evasion Games with Incomplete Information in Discrete Time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-587822