Hat Guessing Games

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.

[1]  András Frank,et al.  Egerváry Research Group on Combinatorial Optimization on the Orientation of Graphs and Hypergraphs on the Orientation of Graphs and Hypergraphs , 2022 .

[2]  Venkat Venkateswaran,et al.  Minimizing maximum indegree , 2004, Discret. Appl. Math..

[3]  Arnold L. Rosenberg.  On the time required to recognize properties of graphs: a problem , 1973, SIGA.

[4]  L RosenbergArnold.  On the time required to recognize properties of graphs , 1973 .

[5]  Bruce A. Reed,et al.  Packing directed circuits , 1996, Comb..

[6]  Yitzhak Birk,et al.  Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients , 2006, IEEE Transactions on Information Theory.

[7]  Uri Stav,et al.  Non-Linear Index Coding Outperforming the Linear Optimum , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[8]  Noam Nisan,et al.  Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs , 1992, J. Comput. Syst. Sci..

[9]  Ziv Bar-Yossef,et al.  Index Coding With Side Information , 2006, IEEE Transactions on Information Theory.

[10]  Noga Alon,et al.  Broadcasting with Side Information , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[11]  Amos Fiat,et al.  Derandomization of auctions , 2005, STOC '05.

[12]  Noam Nisan,et al.  Rounds in Communication Complexity Revisited , 1993, SIAM J. Comput..

[13]  Uri Stav,et al.  Non-Linear Index Coding Outperforming the Linear Optimum , 2007, FOCS.

[14]  Johan Håstad,et al.  On the power of small-depth threshold circuits , 1991, computational complexity.

[15]  W. T. Tutte.  The Factorization of Linear Graphs , 1947 .

[16]  Ronald L. Rivest,et al.  A generalization and proof of the Aanderaa-Rosenberg conjecture , 1975, STOC.