On Levine's Notorious Hat Puzzle

2014/07/17 by Joe Buhler, Chris Freiling, Buhler, Joe +13 · 1 citation
Computer Science · Mathematics · #Artificial Intelligence in Games #Combinatorics (math.CO) #Computability, Logic, AI Algorithms #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #FOS: Mathematics #Mathematical Dynamics and Fractals

paper · pdf · doi:10.48550/arxiv.1407.4711

openalex publication_date 2014/07/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

See the abstract in the attached pdf.

Cited by

• An analytical framework for the Levine hats problem: new strategies, bounds and generalizations

Related

• An analytical framework for the Levine hats problem: new strategies, bounds and generalizations
• The success probability in Lionel Levine's hat problem is strictly decreasing with the number of players, and this is related to interesting questions regarding Hamming powers of Kneser graphs and independent sets in random subgraphs
• Hats: all or nothing
• A probabilistic look at the infinite hat-guessing game
• Yet Another Hat Game