Yet another hat game

MaRDI QIDQ976746zbMATH OpenFDO

Authors Maura Paterson, D. R. Stinson

Publication date 16 June 2010

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1001.3850, https://eudml.org/doc/227323, http://www.emis.de/journals/EJC/Volume_17/Abstracts/v17i1r86.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Ebert's hat gamehats-on-a-line gameoptimal strategy

Mathematics Subject Classification ID

Cooperative games (91A12) Combinatorial games (91A46)

Abstract: Several different "hat games" have recently received a fair amount of attention. Typically, in a hat game, one or more players are required to correctly guess their hat colour when given some information about other players' hat colours. Some versions of these games have been motivated by research in complexity theory and have ties to well-known research problems in coding theory, and some variations have led to interesting new research. In this paper, we review Ebert's Hat Game, which garnered a considerable amount of publicity in the late 90's and early 00's, and the Hats-on-a-line Game. Then we introduce a new hat game which is a "hybrid" of these two games and provide an optimal strategy for playing the new game. The optimal strategy is quite simple, but the proof involves an interesting combinatorial argument.

Review text

Summary: Several different ``hat games have recently received a fair amount of attention. Typically, in a hat game, one or more players are required to correctly guess their hat colour when given some information about other players' hat colours. Some versions of these games have been motivated by research in complexity theory and have ties to well-known research problems in coding theory, and some variations have led to interesting new research. In this paper, we review Ebert's Hat Game, which garnered a considerable amount of publicity in the late 90's and early 00's, and the Hats-on-a-line Game. Then we introduce a new hat game which is a ``hybrid of these two games and provide an optimal strategy for playing the new game. The optimal strategy is quite simple, but the proof involves an interesting combinatorial argument.

Recommendations

• A combinatorial approach to Ebert's hat game with many colors
• Cliques and constructors in ``Hats game. I
• On optimal strategies for a hat game on graphs
• Hat Guessing Games
• New constructions and bounds for Winkler's hat game

Cited in

(21)

• Hat problem: a new strategy based on quantum stabilizer codes
• The Hats game. On maximum degree and diameter
• How to make the perfect fireworks display: two strategies for Hanabi
• On optimal strategies for a hat game on graphs
• On the hat problem, its variations, and their applications
• A New Variation of Hat Guessing Games
• On Levine's notorious hat puzzle
• THE COMPLETE VERSION OF THE GORRITI HAT GAME
• On a conjecture of Butler and Graham
• A combinatorial approach to Ebert's hat game with many colors
• Guessing numbers of odd cycles
• New constructions and bounds for Winkler's hat game
• A Dutch book for group decision-making?
• The Prisoner Shouting Puzzle and variations
• Hat Guessing Games
• Hat Guessing Games
• Strategic equivalence among hat puzzles of various protocols with many colors
• Hat problems.
• A note on marking lines in \([k]^n\)
• Prisoners in a line transmitting (binary+ ) bits of information
• Covering codes for Hats-on-a-line

This page was built for publication: Yet another hat game

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