Levine's hat problem conjecture
Statement
Consider players, each with a stack of independently random black or white hats, and let be the maximal probability that all players select black hats under a joint strategy. Let . Levine's hat problem conjecture. tends to as 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
- Source
- Ehud Friedgut, Gil Kalai and Guy Kindler, “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”, arXiv:2103.01541 (2021).
- MathDB
- Added
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.