SIGEST
Suppose three people walk into a room from three different entrances. Before they enter, a hat is placed on each person. Each hat is either red or blue, but the wearer of the hat doesn't know its col...
Suppose three people walk into a room from three different entrances. Before they enter, a hat is placed on each person. Each hat is either red or blue, but the wearer of the hat doesn't know its col...
Education
Look deeply into my eyes $\ldots$ are you sure it is me? The study of biometrics asks just this question: what physical characteristics can be used to uniquely identify an individual? Fingerprints,...
Look deeply into my eyes $\ldots$ are you sure it is me? The study of biometrics asks just this question: what physical characteristics can be used to uniquely identify an individual? Fingerprints,...
You are not logged in to this journal. Log in
Hat Guessing Games
SIAM Rev. Volume 51, Issue 2, pp. 399-413 (2009)
Published May 4, 2009
Connotea
CiteULike
del.icio.us
BibSonomy
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.
©2009 Society for Industrial and Applied Mathematics| History: | Published May 4, 2009 |
| Permalink: | http://dx.doi.org/10.1137/080743470 |
KEYWORDS and AMS
91A12, 05C20
PUBLICATION DATA
0036-1445 (print)
1095-7200 (online)
SIAM