一个缓存博弈的开放问题的解决方案
The solution to an open problem for a caching game
摘要:
在Alpern等人介绍的缓存游戏中,能够挖掘到归一化为$1$的总固定深度的隐藏者在$n$离散位置中掩埋固定数量的对象。一个可以挖掘到总深度为$h$的搜索者搜索这些位置,目的是找到所有隐藏的对象。如果他这样做,他赢了,否则隐藏者赢了。这种零和对策即使对于其参数的小值也是复杂的,并且对于$2$隐藏对象的情况,只有当游戏在多达$3$的位置中进行时才被完全解决。对于某些值的$h$的解决方案的游戏与$2$对象隐藏在$4$位置是已知的,但在其余情况下的解决方案是一个悬而未决的问题,最近突出的Fokkink等人。在这里,我们解决了其余的情况下的游戏与$2$对象隐藏在$4$位置。我们还给出了一些更一般的结果的游戏,特别是使用几何参数,以表明,当有$2$对象隐藏在$n$的位置和$n \rightarrow \infty$,游戏的价值是渐近等于$h/n$为$h \ge n/2$。
英文摘要:
In a caching game introduced by Alpern et al., a Hider who can dig to a total fixed depth normalized to $1$ buries a fixed number of objects among $n$ discrete locations. A Searcher who can dig to a total depth of $h$ searches the locations with the aim of finding all of the hidden objects. If he does so, he wins, otherwise the Hider wins. This zero-sum game is complicated to analyze even for small values of its parameters, and for the case of $2$ hidden objects has been completely solved only when the game is played in up to $3$ locations. For some values of $h$ the solution of the game with $2$ objects hidden in $4$ locations is known, but the solution in the remaining cases was an open question recently highlighted by Fokkink et al. Here we solve the remaining cases of the game with $2$ objects hidden in $4$ locations. We also give some more general results for the game, in particular using a geometrical argument to show that when there are $2$ objects hidden in $n$ locations and $n \rightarrow \infty$, the value of the game is asymptotically equal to $h/n$ for $h \ge n/2$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。