ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let RPS(n)RPS(n) be the largest value of ss for which Proposer can win the Ramsey, Paper, Scissors game with probability at least 1/21/2. Let CC denote a positive constant, and let ε>0\varepsilon>0.

Limiting-constant conjecture. There is some constant C>0C>0 such that

RPS(n)=(C+o(1))nlog⁡n.RPS(n)=(C+o(1))\sqrt n\log n.

Further, Proposer can win w.h.p. if s<(C−ε)nlog⁡ns<(C-\varepsilon)\sqrt n\log n, while Decider can win w.h.p. if s>(C+ε)nlog⁡ns>(C+\varepsilon)\sqrt n\log n.

This conjecture refines the coarse asymptotic bound RPS(n)=Θ(nlog⁡n)RPS(n)=\Theta(\sqrt n\log n) by predicting a sharp transition at a specific limiting constant. The paper does not establish the existence of such a constant or the asserted winner behavior on either side of it.

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.