The square-root error conjecture for optimal partial-feedback card guessing
Statement
Let denote the maximum expected number of correctly guessed cards in the partial-feedback card-guessing model with card types and copies of each type. Square-root error conjecture. For every and sufficiently large,
The conjecture would improve the paper's proved upper bound and would nearly match the known lower bound . The authors identify two parts of the proof where the current error term is oversized, so the conjecture remains open.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.