Asymmetric Hat Game with three players and three colors
Combinatorics
2021-11-25 v5 Discrete Mathematics
Information Theory
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.
Keywords
Cite
@article{arxiv.1612.05924,
title = {Asymmetric Hat Game with three players and three colors},
author = {Theo van Uem},
journal= {arXiv preprint arXiv:1612.05924},
year = {2021}
}
Comments
it is now part of arXiv:1612.00276 (Ebert's asymmetric Hat Game)