2000 character limit reached
Asymmetric Hat Game with three players and three colors (1612.05924v5)
Published 18 Dec 2016 in math.CO, cs.DM, cs.IT, and math.IT
Abstract: Winning probabilities of The Hat Game (Ebert's Hat Problem) with three players and three colors are only known in the symmetric case: all probabilities of the colors are equal. This paper solves the asymmetric case: probabilities may be different. We find winning probabilies and optimal strategies in all cases.