This paper studies Ebert's hat problem for three players and two colors, where the probabilities of the colors may be different for each player. Our goal is to maximize the probability of winning the game and to describe winning strategies We use the new concept of an adequate set. The construction of adequate sets is independent of underlying probabilities and we can use this fact in the analysis of our general case.
翻译:本文研究了 Ebert 的三人两色帽子问题,其中每个玩家的颜色概率可能不同。我们的目标是尽可能提高获胜的概率并描述获胜策略。我们使用了充分集的新概念。适当集的构建与底层概率无关,因此可以在我们的一般情况分析中使用该事实。