2017/04/13 by van Uem, Theo
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT)
paper · doi:10.48550/arxiv.1704.04244
This paper studies Ebert's hat problem for three and four 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 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.