On the hat problem, its variations, and their applications
Abstract
The topic of our paper is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of a win. There are known many variations of the hat problem. In this paper we give a comprehensive list of variations considered in the literature. We describe the applications of the hat problem and its variations, and their connections to different areas of science. We give the full bibliography of any papers, books, and electronic publications about the hat problem.
References
G. Aggarwal, A. Fiat, A. Goldberg, J. Hartline, N. Immorlica, M. Sudan, Derandomization of auctions, Proceedings of the 37th Annual ACM Symposium on Theory of Computing, ACM, New York, 2005, 619–625.
##plugins.generic.googleScholarLinks.settings.viewInGS##
N. Alon, Asynchronous Threshold Networks, Graphs Combin. 1 (1985), 305–310.
##plugins.generic.googleScholarLinks.settings.viewInGS##
N. Alon, Problems and results in extremal combinatorics, II, Discrete Math. 308 (2008), 4460–4472.
##plugins.generic.googleScholarLinks.settings.viewInGS##
S. Aravamuthan, S. Lodha, Covering codes for Hats-on-a-line, Electron. J. Combin. 13 (2006), Research Paper 21, 12 pp.
##plugins.generic.googleScholarLinks.settings.viewInGS##
J. Aspnes, R. Beigel, M. Furst, S. Rudich, The expressive power of voting polynomials, Combinatorica 14 (1994), 135–148.
##plugins.generic.googleScholarLinks.settings.viewInGS##
R. Beigel, L. Fortnow, F. Stephan, Infinitely-often autoreducible sets, SIAM J. Comput. 36 (2006), 595–608.
##plugins.generic.googleScholarLinks.settings.viewInGS##
Berkeley Riddles, www.ocf.berkeley.edu/wwu/riddles/hard.shtml.
##plugins.generic.googleScholarLinks.settings.viewInGS##
M. Bernstein, The hat problem and Hamming codes, MAA Focus, November 2001, 4–6.
##plugins.generic.googleScholarLinks.settings.viewInGS##
W. Blum, Denksport für Hutträger, Die Zeit, May 3, 2001.
##plugins.generic.googleScholarLinks.settings.viewInGS##
J. Blowers, Hats and hangar queens, http://jimvb.home.mindspring.com/hatqueen.htm.
##plugins.generic.googleScholarLinks.settings.viewInGS##
M. Breit, D. Deshommes, A. Falden, Hats required: perfect and imperfect strategies for the hat problem, manuscript.
##plugins.generic.googleScholarLinks.settings.viewInGS##
E. Brown, K. Mellinger, Kirkman's schoolgirls wearing hats and walking through fields of numbers, Math. Mag. 82 (2009), 3–15.
##plugins.generic.googleScholarLinks.settings.viewInGS##
J. Buhler, Hat tricks, Math. Intelligencer 24 (2002), 44–49.
##plugins.generic.googleScholarLinks.settings.viewInGS##
E. Burke, S. Gustafson, G. Kendall, A puzzle to challenge genetic programming, Genetic Programming, Lecture Notes in Computer Science, Springer, 2002, 136–147.
##plugins.generic.googleScholarLinks.settings.viewInGS##
S. Butler, M. Hajianghayi, R. Kleinberg, T. Leighton, Hat guessing games, SIAM J. Discrete Math. 22 (2008), 592–605.
##plugins.generic.googleScholarLinks.settings.viewInGS##
L. Calloway, J. Casher, S. Hoehn, From guessing games to compact discs: some applications of coding theory, manuscript.
##plugins.generic.googleScholarLinks.settings.viewInGS##
G. Cohen, I. Honkala, S. Litsyn, A. Lobstein, Covering Codes, Mathematical Library 54, North-Holland, 1997.
##plugins.generic.googleScholarLinks.settings.viewInGS##
J. Demongeot, E. Goles, M. Tchuente, Dynamical Systems and Cellular Automata, Academic Press, London, 1985.
##plugins.generic.googleScholarLinks.settings.viewInGS##
N. Do, Communicating with eyes, hats and light bulb, Austral. Math. Soc. Gaz. 33 (2006), 157–164.
##plugins.generic.googleScholarLinks.settings.viewInGS##
T. Ebert, Applications of recursive operators to randomness and complexity, Ph.D. Thesis, University of California at Santa Barbara, 1998.
##plugins.generic.googleScholarLinks.settings.viewInGS##
T. Ebert, W. Merkle, Autoreducibility of random sets: a sharp bound on the density of guessed bits, Mathematical Foundations of Computer Science 2002, Lecture Notes in Comput. Sci. 2420, Springer, Berlin, 2002, 221–233.
##plugins.generic.googleScholarLinks.settings.viewInGS##
T. Ebert, W. Merkle, H. Vollmer, On the autoreducibility of random sequences, SIAM J. Comput. 32 (2003), 1542–1569.
##plugins.generic.googleScholarLinks.settings.viewInGS##
T. Ebert, H. Vollmer, On the autoreducibility of random sequences, Mathematical Foundations of Computer Science 2000 (Bratislava), Lecture Notes in Comput. Sci. 1893, Springer, Berlin, 2000, 333–342.
##plugins.generic.googleScholarLinks.settings.viewInGS##
U. Feige, On optimal strategies for a hat game on graphs, submitted.
##plugins.generic.googleScholarLinks.settings.viewInGS##
U. Feige, You can leave your hat on (if you guess its color), Technical Report MCS04-03, Computer Science and Applied Mathematics, The Weizmann Institute of Science, 2004, 10 pp.
##plugins.generic.googleScholarLinks.settings.viewInGS##
J. French, A formal theory of social power, Psychological Review 63 (1956), 181–194.
##plugins.generic.googleScholarLinks.settings.viewInGS##
A. Frieze, D. Sleator, Puzzle 15: hat problems, Alan and Danny's puzzle page, www.cs.cmu.edu/puzzle.
##plugins.generic.googleScholarLinks.settings.viewInGS##
D. Gale, I. Adler, Colored gaps and covering codes, manuscript, 2001.
##plugins.generic.googleScholarLinks.settings.viewInGS##
M. Gardner, The Second Scientific American Book of Mathematical Puzzles and Diversions, University of Chicago Press, Chicago, 1987.
##plugins.generic.googleScholarLinks.settings.viewInGS##
W. Guo, S. Kasala, M. Rao, B. Tucker, The hat problem and some variations, Advances in Distribution Theory, Order Statistics, and Inference, Stat. Ind. Technol., Birkhäuser, Boston, 2006, 459–479.
##plugins.generic.googleScholarLinks.settings.viewInGS##
F. Harary, A criterion for unanimity in French's theory of social power, Studies in Social Power, University of Michigan Press, Ann Arbor, 1959, 168–182.
##plugins.generic.googleScholarLinks.settings.viewInGS##
C. Hardin, A. Taylor, An introduction to infinite hat problems, Math. Intelligencer 30 (2008), 20–25.
##plugins.generic.googleScholarLinks.settings.viewInGS##
C. Hardin, A. Taylor, Hat problem observations, manuscript.
##plugins.generic.googleScholarLinks.settings.viewInGS##
A. Hoffman, J. Kruskal, Integral boundary points of convex polyhedra, Linear Inequalities and Related Systems, Annals of Mathematics Studies 38, Princeton University Press, Princeton, 1956, 223–246.
##plugins.generic.googleScholarLinks.settings.viewInGS##
N. Immorlica, Computing with strategic agents, Ph.D. Thesis, Massachusetts Institute of Technology, 2005.
##plugins.generic.googleScholarLinks.settings.viewInGS##
M. Krzywkowski, A modified hat problem, submitted.
##plugins.generic.googleScholarLinks.settings.viewInGS##
M. Krzywkowski, A more colorful hat problem, submitted.
##plugins.generic.googleScholarLinks.settings.viewInGS##
M. Krzywkowski, Hat problem on a graph, Math. Pannon. 21 (2010), 3–21.
##plugins.generic.googleScholarLinks.settings.viewInGS##
M. Krzywkowski, Hat problem on the cycle C4, Int. Math. Forum 5 (2010), 205–212.
##plugins.generic.googleScholarLinks.settings.viewInGS##
H. Lenstra, G. Seroussi, On hats and other covers, IEEE International Symposium on Information Theory, Lausanne, 2002.
##plugins.generic.googleScholarLinks.settings.viewInGS##
S. Litsyn, Simon Litsyn's online table of covering codes, www.eng.tau.ac.il/litsyn/tablecr.
##plugins.generic.googleScholarLinks.settings.viewInGS##
J. O'Connor, E. Robertson, Hamming biography, www.history.mcs.st-and.ac.uk/Biographies/Hamming.html.
##plugins.generic.googleScholarLinks.settings.viewInGS##
S. Poljak, M. Sura, On periodical behavior in societies with symmetric influences, Combinatorica 3 (1983), 119–121.
##plugins.generic.googleScholarLinks.settings.viewInGS##
J. Poulos, Could you solve this $1 million hat trick?, abcNews, November 29, 2001.
##plugins.generic.googleScholarLinks.settings.viewInGS##
F. Roberts, Discrete Mathematical Models, with Application to Social, Biological, and Environmental Problems, Prentice-Hall, Englewood Cliffs, 1976.
##plugins.generic.googleScholarLinks.settings.viewInGS##
S. Robinson, Why mathematicians now care about their hat color, The New York Times, Science Times Section, April 10, 2001, D5.
##plugins.generic.googleScholarLinks.settings.viewInGS##
S. Roman, Coding and Information Theory, Springer-Verlag, New York, 1992.
##plugins.generic.googleScholarLinks.settings.viewInGS##
D. Sasha, Crowns of the Minotaur, Scientific American, October 2001, 82.
##plugins.generic.googleScholarLinks.settings.viewInGS##
P. Winkler, Games people don't play, Puzzlers' Tribute, A.K. Peters, Natick, Massachusetts, 2001, 301–313.
##plugins.generic.googleScholarLinks.settings.viewInGS##
P. Winkler, Mathematical Puzzles: A Connoisseur's Collection, A.K. Peters, Wellesley, Massachusetts, 2004.
##plugins.generic.googleScholarLinks.settings.viewInGS##
P. Winkler, Mathematical Mind-Benders, A.K. Peters, Wellesley, Massachusetts, 2007.
##plugins.generic.googleScholarLinks.settings.viewInGS##
