ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider tt players, each with a stack of nn independently random black or white hats, and let p(t,n)p(t,n) be the maximal probability that all players select black hats under a joint strategy. Let p(t)=lim⁡n→∞p(t,n)p(t)=\lim_{n\to\infty}p(t,n). Levine's hat problem conjecture. p(t)p(t) tends to 00 as tt grows. This is the original challenge posed by Lionel Levine and concerns the asymptotic success probability of the hats game as the number of players increases.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.