Hat Guessing Games

DOI10.1137/080743470MaRDI QIDQ5902082zbMATH OpenOpenAlexFDO

Authors Steve Butler, Mohammad T. Hajiaghayi, Tom Leighton, 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

deterministic strategyhat gamehypercubesight graphTutte-Berge formula

Mathematics Subject Classification ID

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

Recommendations

• Hat Guessing Games
• On the hat problem, its variations, and their applications
• Yet another hat game
• A more colorful hat problem
• A modified hat problem

Cited in

(25)

• Cliques and constructors in ``Hats game. I
• Cliques and constructors in ``Hats game. II
• Hat problem: a new strategy based on quantum stabilizer codes
• The Hats game. On maximum degree and diameter
• Guessing numbers and extremal graph theory
• For which graphs the sages can guess correctly the color of at least one hat
• On the hat problem, its variations, and their applications
• A New Variation of Hat Guessing Games
• A modified hat problem
• On Levine's notorious hat puzzle
• THE COMPLETE VERSION OF THE GORRITI HAT GAME
• A more colorful hat problem
• Guessing numbers of odd cycles
• Guessing Games
• Hypercube orientations with only two in-degrees
• Hat Guessing Games
• On 1-factorizations of bipartite Kneser graphs
• Hat problems.
• Hat Guessing Numbers of Strongly Degenerate Graphs
• Hat guessing number for the class of planar graphs is at least 22
• An introduction to infinite hat problems
• A note on marking lines in \([k]^n\)
• Bounds on guessing numbers and secret sharing combining information theory methods.
• Covering codes for Hats-on-a-line
• Yet another hat game

This page was built for publication: Hat Guessing Games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5902082)