arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2012.13484math.COcs.DS
收藏

关于部分信息检索:无约束100囚犯问题

On partial information retrieval: the unconstrained 100 prisoner problem

Ivano Lodato, Snehal M. Shekatkar, Tian An Wong

摘要:

我们考虑了经典的100个囚犯问题及其变种的推广,涉及空盒子,其中获胜的概率为一个团队取决于尝试的次数,以及对获胜者的数量。我们称之为无约束100囚犯问题。在介绍了3个主要类别的战略,我们定义了各种“混合”的战略和量化他们的获胜效率。当分析结果不可用时,我们利用蒙特卡罗模拟来高精度地估计获胜概率。基于所得结果,我们猜想,除了经典(约束)问题的获胜概率最大化的策略外,所有策略都在弱条件下收敛于随机策略.最后,我们评论我们的研究结果在理解信息检索过程中的可能应用,如“记忆”在活的生物体。

英文摘要:

We consider a generalization of the classical 100 Prisoner problem and its variant, involving empty boxes, whereby winning probabilities for a team depend on the number of attempts, as well as on the number of winners. We call this the unconstrained 100 prisoner problem. After introducing the 3 main classes of strategies, we define a variety of `hybrid' strategies and quantify their winning-efficiency. Whenever analytic results are not available, we make use of Monte Carlo simulations to estimate with high accuracy the winning-probabilities. Based on the results obtained, we conjecture that all strategies, except for the strategy maximizing the winning probability of the classical (constrained) problem, converge to the random strategy under weak conditions on the number of players or empty boxes. We conclude by commenting on the possible applications of our results in understanding processes of information retrieval, such as ``memory'' in living organisms.

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

↑