arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2305.10342math.OCmath.PR
收藏

计算离散位置搜索博弈的最优策略

Computing Optimal Strategies for a Search Game in Discrete Locations

Jake Clarkson, Kyle Y Lin

AI总结:

研究隐藏者与搜索者之间的两人零和搜索博弈,提出一种计算双方最优策略的算法,并通过数值研究验证其效率及最优隐藏策略特征。

摘要:

考虑隐藏者与搜索者之间的两人零和搜索博弈。隐藏者藏于n个离散位置中,搜索者依次访问各个位置直至找到隐藏者。双方均知,在位置i的搜索耗时t_i个时间单位,若隐藏者藏于此,则以概率α_i独立检测到隐藏者,i=1,…,n。隐藏者旨在最大化直至检测的期望时间,而搜索者旨在最小化该时间。我们提出一种算法来计算每位玩家的最优策略。我们在数值研究中展示了该算法的效率,并研究了最优隐藏策略的特征。

英文摘要:

Consider a two-person zero-sum search game between a hider and a searcher. The hider hides among $n$ discrete locations, and the searcher successively visits individual locations until finding the hider. Known to both players, a search at location $i$ takes $t_i$ time units and detects the hider -- if hidden there -- independently with probability $α_i$, for $i=1,\ldots,n$. The hider aims to maximize the expected time until detection, while the searcher aims to minimize it. We present an algorithm to compute an optimal strategy for each player. We demonstrate the algorithm's efficiency in a numerical study, in which we also study the characteristics of the optimal hiding strategy.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑