On Levine's notorious hat puzzle

Buhler, Joe; Freiling, Chris; Graham, Ron; Kariv, Jonathan; Roche, J.R.; Tiefenbruck, Mark; Alten, C. J. Van; Yeroshkin, Dmytro

doi:10.48550/arxiv.1407.4711

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

Publication Types

Select...

Other1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While preparing this paper we were sent a draft of a comprehensive hat-related paper by Buhler, Freiling, Graham, Kariv, Roche, Tiefenbruck, Van Alten and Yeroshkin [5], where Theorem 1.2 is also proven, along with other interesting results and bounds. We refer to their paper as an excellent source for background on the state of the art for this problem.…”

Section: Introductionmentioning

confidence: 99%

The success probability in Levine's hat problem, and independent sets in graphs

Alon¹,

Friedgut²,

Kalai³

et al. 2022

Preprint

View full text Add to dashboard Cite

Lionel Levine's hat challenge has t players, each with a (very large, or infinite) stack of hats on their head, each hat independently colored at random black or white. The players are allowed to coordinate before the random colors are chosen, but not after. Each player sees all hats except for those on her own head. They then proceed to simultaneously try and each pick a black hat from their respective stacks. They are proclaimed successful only if they are all correct. Levine's conjecture is that the success probability tends to zero when the number of players grows. We prove that this success probability is strictly decreasing in the number of players, and present some connections to problems in graph theory: relating the size of the largest independent set in a graph and in a random induced subgraph of it, and bounding the size of a set of vertices intersecting every maximum-size independent set in a graph.

show abstract

Section: Introductionmentioning

confidence: 99%