Hat Guessing Games

DOI10.1137/080743470zbMath1166.91004OpenAlexW2045203810MaRDI QIDQ5902082

Leighton, Tom, Mohammad Taghi Hajiaghayi, Steve Butler, Robert D. Kleinberg

Publication date: 11 June 2009

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/080743470

zbMATH Keywords

hypercubehat gamedeterministic strategyTutte-Berge formulasight graph

Mathematics Subject Classification ID

Cooperative games (91A12) Directed graphs (digraphs), tournaments (05C20)

Related Items (11)

For which graphs the sages can guess correctly the color of at least one hat ⋮ Guessing numbers and extremal graph theory ⋮ Hat Guessing Numbers of Strongly Degenerate Graphs ⋮ Hat guessing number for the class of planar graphs is at least 22 ⋮ Guessing numbers of odd cycles ⋮ A note on marking lines in \([k^n\)] ⋮ Hypercube orientations with only two in-degrees ⋮ Cliques and constructors in ``Hats game. I ⋮ Cliques and constructors in ``Hats game. II ⋮ On 1-factorizations of bipartite Kneser graphs ⋮ Hat problem: a new strategy based on quantum stabilizer codes

This page was built for publication: Hat Guessing Games