{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T08:24:36Z","timestamp":1790497476881,"version":"4.1.0"},"reference-count":19,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM Rev."],"published-print":{"date-parts":[[2009,5]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1137\/080743470","type":"journal-article","created":{"date-parts":[[2009,5,1]],"date-time":"2009-05-01T18:07:09Z","timestamp":1241201229000},"page":"399-413","source":"Crossref","is-referenced-by-count":22,"title":["Hat Guessing Games"],"prefix":"10.1137","volume":"51","author":[{"given":"Steve","family":"Butler","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammad T.","family":"Hajiaghayi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert D.","family":"Kleinberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tom","family":"Leighton","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2009,5,4]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"G. Aggarwal, A. Fiat, A. V. Goldberg, J. D. Hartline, N. Immorlica, and M. Sudan,\n                      Derandomization of auctions\n                      , in Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), 2005, pp. 619\u2013625.","DOI":"10.1145\/1060590.1060682"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"N. Alon, A. Hassidim, E. Lubetzky, U. Stav, and A. Weinberg,\n                      Broadcasting with side information\n                      , in Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2008, pp. 823\u2013832.","DOI":"10.1109\/FOCS.2008.41"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(92)90047-M"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Z. Bar-Yossef, Y. Birk, T. S. Jayram, and T. Kol,\n                      Index coding with side information\n                      , in Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2006, pp. 197\u2013206.","DOI":"10.1109\/FOCS.2006.42"},{"key":"R5","first-page":"258","volume":"247","author":"Berge C.","year":"1958","journal-title":"C. R. Acad. Sci. Paris"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874540"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"A. Chandra, M. Furst, and R. Lipton,\n                      Multiparty protocols\n                      , in Proceedings of the 15th Annual ACM Symposium on Theory of Computing (STOC), 1983, pp. 93\u201399.","DOI":"10.1145\/800061.808737"},{"key":"R8","unstructured":"U. Feige,\n                      You Can Leave Your Hat On (If You Guess Its Color)\n                      , Technical report MCS04-03, Computer Science and Applied Mathematics, The Weizmann Institute of Science, Rehovot, Israel, 2004."},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00462-6"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01272517"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"E. Lubetzky and U. Stav,\n                      Non-linear index coding outperforming the linear optimum\n                      , in Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2007, pp. 161\u2013167.","DOI":"10.1109\/FOCS.2007.48"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1137\/0222016"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01271272"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"R. L. Rivest and J. Vuillemin,\n                      A generalization and proof of the Aanderaa\u2013Rosenberg conjecture\n                      , in Proceedings of the 7th Annual ACM Symposium on Theory of Computing (STOC), 1975, pp. 6\u201311.","DOI":"10.1145\/800116.803747"},{"key":"R15","unstructured":"S. Robinson,\n                      Why mathematicians now care about their hat color\n                      , New York Times, D5, April 10, 2001."},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1145\/1008299.1008302"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-22.2.107"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2003.07.007"},{"key":"R19","unstructured":"P. Winkler,\n                      Games people don't play\n                      , in Puzzler's Tribute: A Feast for the Mind, D. Wolfe and T. Rogers, eds., A. K. Peters, Baltimore, MD, 2002, pp. 301\u2013313."}],"container-title":["SIAM Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/080743470","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,20]],"date-time":"2026-08-20T13:01:09Z","timestamp":1787230869000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/080743470"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,5,1]]}},"alternative-id":["10.1137\/080743470"],"URL":"https:\/\/doi.org\/10.1137\/080743470","relation":{},"ISSN":["0036-1445","1095-7200"],"issn-type":[{"value":"0036-1445","type":"print"},{"value":"1095-7200","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5]]}}}