Skip to main content
SpringerLink
Log in

The Hat Problem and Some Variations

  • Chapter
Advances in Distribution Theory, Order Statistics, and Inference

Part of the book series: Statistics for Industry and Technology ((SIT))

  • 3047 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Buhler, J. P. (2002). Hat tricks, The Mathematical Intelligencer, 24, 44–49.

    Article  MathSciNet  Google Scholar 

  2. Cohen, G., Honkala, I., Litsyn, S., and Lobstein, A. (1997). Covering Codes, North-Holland, Amsterdam.

    MATH  Google Scholar 

  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.

    MathSciNet  Google Scholar 

  4. Lenstra, H., and Seroussi, G. (2004). On hats and other covers, Preprint.

    Google Scholar 

  5. Robinson, S. (2001). Why mathematicians care about their hat color, New York Times, Science Tuesday, April 10, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Cincinnati, Cincinnati, OH, USA

    Wenge Guo & M. Bhaskara Rao

  2. University of North Carolina, Wilmington, NC, USA

    Subramanyam Kasala

  3. Pracs Institute, Fargo, ND, USA

    Brian Tucker

Authors
  1. Wenge Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Subramanyam Kasala
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Bhaskara Rao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Brian Tucker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Statistics, McMaster University, 1280 Main Street West, Hamilton, Ontario, L8S 4K1, Canada

    N. Balakrishnan

  2. Department of Economics, University of Cantabria, s/n Avenida de los Castros, Santander, 39005, Spain

    José María Sarabia  & Enrique Castillo  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Birkhäuser Boston

About this chapter

Cite this chapter

Guo, W., Kasala, S., Rao, M.B., Tucker, B. (2006). The Hat Problem and Some Variations. In: Balakrishnan, N., Sarabia, J.M., Castillo, E. (eds) Advances in Distribution Theory, Order Statistics, and Inference. Statistics for Industry and Technology. Birkhäuser Boston. https://doi.org/10.1007/0-8176-4487-3_29

Download citation

Publish with us

Policies and ethics

Search

Navigation