A hide–search game
A hide–search game
复制标题
一款隐藏搜索游戏
DOI：
10.2307/3213317
复制
发表时间：
1981
影响因子：
1
通讯作者：
E. J. Subelman
中科院分区：
文献类型：
--
作者：
E. J. Subelman
我们考虑一个博弈，其中一个参与人将球藏在n个盒子中的一个盒子里，另一个参与人被允许去寻找它，如果他去寻找正确的盒子，那么他忽略球的概率是已知的。藏球者希望最小化，藏球者希望最大化在m次或更少的搜索中找到球的概率。我们展示了一个程序，它允许有效的计算双方球员的最佳策略，而不解决游戏作为一个线性规划。结果被扩展到一个非零和游戏，其中的目标是最小化的预期时间，直到球被发现。
We consider a game in which one player hides a ball in one of n boxes and the other player is allowed to search for it. There are known probabilities that the searcher will overlook the ball if he searches the correct box. The hider wishes to minimize and the searcher to maximize the probability that the ball will be found in m or fewer searches. We exhibit a procedure which allows efficient computation of optimal strategies for both players without solving the game as a linear program. The results are extended to a non-zero-sum game where the searcher's objective is to minimize the expected time until the ball is found.