Pursuit-evasion games with incomplete information in discrete time

From MaRDI portal
Publication:532679

DOI10.1007/S00182-009-0158-5zbMATH Open1211.91069arXiv0708.2556OpenAlexW2065654548MaRDI QIDQ532679FDOQ532679


Authors: Ori Gurel-Gurevich Edit this on Wikidata


Publication date: 5 May 2011

Published in: International Journal of Game Theory (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/0708.2556




Recommendations




Cites Work


Cited In (7)





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)