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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Bibliography
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)
Butler, S., Hajiaghayi, M.T., Kleinberg, R.D., Leighton, T.: Hat guessing games. SIAM J. Discret. Math. 22, 592–605 (2008)
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)
Hardin, C.S., Taylor, A.D.: An introduction to infinite hat problems. Math. Intell. 30(4), 20–25 (2008)
Hardin, C.S., Taylor, A.D.: Minimal predictors in hat problems. Fundam. Math. 208, 273–285 (2010)
Tutte, W.T.: The factorization of linear graphs. J. Lond. Math. Soc. 22, 107–111 (1947)
Velleman, D.J.: The even-odd hat problem (2011, preprint)
Winkler, P.: Games people don’t play. In: Wolfe, D., Rodgers, T. (eds.) Puzzlers’ Tribute, pp. 301–313. A K Peters, Natick (2001)
Yiparaki, O.: On some tree partitions. PhD thesis, University of Michigan (1994)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Hardin, C.S., Taylor, A.D. (2013). The Finite Setting. In: The Mathematics of Coordinated Inference. Developments in Mathematics, vol 33. Springer, Cham. https://doi.org/10.1007/978-3-319-01333-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-01333-6_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-01332-9
Online ISBN: 978-3-319-01333-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)