The Hat Problem and Some Variations

  • Wenge Guo
  • Subramanyam Kasala
  • M. Bhaskara Rao
  • Brian Tucker
Part of the Statistics for Industry and Technology book series (SIT)


The hat problem arose in the context of computational complexity. It started as a puzzle, but the problem has been found to have connections with coding theory and has reached the research frontier of mathematics, statistics and computer science. In this article, some variations of the hat problem are presented along with their solutions. An application is indicated.

Keywords and phrases

Computational complexity optimization strategy winning probability 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Buhler, J. P. (2002). Hat tricks, The Mathematical Intelligencer, 24, 44–49.MathSciNetCrossRefGoogle Scholar
  2. 2.
    Cohen, G., Honkala, I., Litsyn, S., and Lobstein, A. (1997). Covering Codes, North-Holland, Amsterdam.zbMATHGoogle Scholar
  3. 3.
    Ebert, T., and Vollmer, H. (2000). On the autoreducibility of random sequences, In Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science, Springer Lecture Notes in Computer Science, Vol. 1893, pp. 333–342.MathSciNetGoogle Scholar
  4. 4.
    Lenstra, H., and Seroussi, G. (2004). On hats and other covers, Preprint.Google Scholar
  5. 5.
    Robinson, S. (2001). Why mathematicians care about their hat color, New York Times, Science Tuesday, April 10, 2001.Google Scholar

Copyright information

© Birkhäuser Boston 2006

Authors and Affiliations

  • Wenge Guo
    • 1
  • Subramanyam Kasala
    • 2
  • M. Bhaskara Rao
    • 1
  • Brian Tucker
    • 3
  1. 1.University of CincinnatiCincinnatiUSA
  2. 2.University of North CarolinaWilmingtonUSA
  3. 3.Pracs InstituteFargoUSA

Personalised recommendations