A remark on the princess and monster search game |
| |
Authors: | Professor A Yu Garnaev |
| |
Institution: | 1. Department of Computational Mathematics, Leningrad Civil Engineering Institute, 2-ya Krasnoarmejskaya 4, 198005, Leningrad, UDSSR
|
| |
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. |
| |
Keywords: | Search Game Princess and Monster game optimal strategies |
本文献已被 SpringerLink 等数据库收录! |
|