Decentralized team decision via coding
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Hypercube orientations with only two in-degrees
Journal of Combinatorial Theory Series A
| Hi-index | 0.01 |
Hat problems have become a popular topic in recreational mathematics. In a typical hat problem, each of $n$ players tries to guess the color of the hat he or she is wearing by looking at the colors of the hats worn by some of the other players. In this paper we consider several variants of the problem, united by the common theme that the guessing strategies are required to be deterministic and the objective is to maximize the number of correct answers in the worst case. We also summarize what is currently known about the worst-case analysis of deterministic hat guessing problems with a finite number of players.