arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1612.00276cs.ITmath.COmath.IT
收藏

Ebert的非对称三人三色帽子博弈

Ebert's asymmetric three person three color Hat Game

Theo van Uem

AI总结:

本文推广Ebert的帽子问题至三人三色非对称情形,利用与概率无关的“充分集”概念最大化获胜概率并描述策略,同时显著降低计算复杂度。

摘要:

我们将Ebert的帽子问题推广到三人三色的情况。所有玩家在仅观察到其他玩家帽子颜色的情况下,同时猜测自己帽子的颜色。每个玩家也可以选择弃权(不执行):即不猜测任何颜色。如果至少有一个玩家正确猜中自己的帽子颜色,且没有玩家猜错,则团队获胜。本文研究Ebert的帽子问题,其中颜色的概率可能不同(非对称情况)。我们的目标是最大化获胜概率并描述获胜策略。本文使用“充分集”的概念。充分集的构造与底层概率无关,我们利用这一事实分析非对称情况。另一个值得关注的点是,使用充分集的计算复杂度远低于标准方法。

英文摘要:

We generalize Ebert's Hat Problem for three persons and three colors. All players guess simultaneously the color of their own hat observing only the hat colors of the other players. It is also allowed for each player to pass: no color is guessed. The team wins if at least one player guesses his or her hat color correct and none of the players has an incorrect guess. This paper studies Ebert's hat problem, where the probabilities of the colors may be different (asymmetric case). Our goal is to maximize the probability of winning the game and to describe winning strategies. In this paper we use the notion of an adequate set. The construction of adequate sets is independent of underlying probabilities and we can use this fact in the analysis of the asymmetric case. Another point of interest is the fact that computational complexity using adequate sets is much less than using standard methods.

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

↑