Optimal-strategy limit distribution conjecture for semi-restricted Rock, Paper, Scissors

From papers

Consider the semi-restricted Rock, Paper, Scissors game with score SnS_n, and let SnopS_n^{\mathrm{op}} denote the score when both players use optimal strategies. Let WW and Z1,Z2,Z3Z_1,Z_2,Z_3 be the random variables from Theorem~, and define

Zmax:=max{Z1,Z2,Z3}.Z_{\max}:=\max\{Z_1,Z_2,Z_3\}.

The variables WW and ZmaxZ_{\max} may be dependent. Optimal-strategy limit distribution conjecture. If both players play optimally, then

n1/2SnopdSop=W+Zmax.n^{-1/2} S_n^{\mathrm{op}}\overset{\mathrm{d}}{\longrightarrow} \mathcal S^{\mathrm{op}}=W+Z_{\max}.

The preceding theorem motivates this conjecture, but the supplied text describes the optimal strategy for one player as unknown and provides no resolution of the conjecture.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Svante Janson, “On semi-restricted Rock, Paper, Scissors”, arXiv:2402.14676 (2024).

Solutions 0

No solutions have been posted yet.