Advertisement

The Finite Setting

  • Christopher S. Hardin
  • Alan D. Taylor
Chapter
Part of the Developments in Mathematics book series (DEVM, volume 33)

Abstract

Although our primary interest in this monograph is with the infinite, we begin with a discussion of hat problems in which the set A of agents is finite and visibility is given by a directed graph on A (the visibility graph). Most of what is known in the finite case (where agents cannot pass) can be found in a single paper entitled Hat Guessing Games, by Steve Butler, Mohammad Hajiaghayi, Robert Kleinberg, and Tom Leighton. This chapter considers minimal predictors (which guarantee at least one correct guess), optimal predictors (which achieve the most correct guesses possible in the given context), a relationship between the Tutte-Berge formula and how successful predictors can be in symmetric visibility graphs, hat problems with a variable number of colors, and other variations on the standard hat problem.

Bibliography

  1. [B58]
    Berge, C.: Sur le couplage maximum d’un graphe. Comptes rendus hebdomadaires des séances de l’Académie des sciences 247, 258–259 (1958)MathSciNetzbMATHGoogle Scholar
  2. [BHKL08]
    Butler, S., Hajiaghayi, M.T., Kleinberg, R.D., Leighton, T.: Hat guessing games. SIAM J. Discret. Math. 22, 592–605 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  3. [Fei04]
    Feige, U.: You can leave your hat on (if you guess the color). Technical report MCS04-03, Computer Science and Applied Mathematics, The Weizmann Institute of Science, p. 10 (2004)Google Scholar
  4. [HT08a]
    Hardin, C.S., Taylor, A.D.: An introduction to infinite hat problems. Math. Intell. 30(4), 20–25 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  5. [HT10]
    Hardin, C.S., Taylor, A.D.: Minimal predictors in hat problems. Fundam. Math. 208, 273–285 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  6. [Tu47]
    Tutte, W.T.: The factorization of linear graphs. J. Lond. Math. Soc. 22, 107–111 (1947)MathSciNetCrossRefzbMATHGoogle Scholar
  7. [Vel11]
    Velleman, D.J.: The even-odd hat problem (2011, preprint)Google Scholar
  8. [Win01]
    Winkler, P.: Games people don’t play. In: Wolfe, D., Rodgers, T. (eds.) Puzzlers’ Tribute, pp. 301–313. A K Peters, Natick (2001)Google Scholar
  9. [Yip94]
    Yiparaki, O.: On some tree partitions. PhD thesis, University of Michigan (1994)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  • Christopher S. Hardin
    • 1
  • Alan D. Taylor
    • 2
  1. 1.New YorkUSA
  2. 2.Department of MathematicsUnion CollegeSchenectadyUSA

Personalised recommendations