International Journal of Game Theory

, Volume 20, Issue 3, pp 269–276

A remark on the princess and monster search game

  • A. Yu. Garnaev
Article

DOI: 10.1007/BF01253781

Cite this article as:
Garnaev, A.Y. Int J Game Theory (1992) 20: 269. doi:10.1007/BF01253781

Abstract

We consider two zero-sum search games in which a searcher moves along a continuous trajectory in a search setQ. The probability of detection depends on the distance between the two players. The problem is “open loop”, i.e. neither player receives any information about the other as the game progresses. The payoff to a hider is the elapsed time before detection. Optimal mixed strategies are obtained.

Key words

Search GamePrincess and Monster gameoptimal strategies

Copyright information

© Physica-Verlag 1992

Authors and Affiliations

  • A. Yu. Garnaev
    • 1
  1. 1.Department of Computational MathematicsLeningrad Civil Engineering InstituteLeningradUDSSR