ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SS be a properly bounded strategy, let RS{\rm RS} denote the random strategy, and let ϵS,RS\epsilon_{S,\mathrm{RS}} be the metric distance between their P-functions for parameters nn and NN. Let KS0{\rm KS}^0 denote the excluded key strategy in which players do not start by opening their own box. Convergence-to-random conjecture. For every properly bounded strategy SS other than KS0{\rm KS}^0, its P-function converges to that of the random strategy in the following senses:

lim⁡N→∞ϵS,RS=0,for n=N,\lim_{N\to \infty}\epsilon_{S,\mathrm{RS}}=0,\qquad \text{for } n=N,

and

lim⁡n/N→0ϵS,RS=0,for n<N.\lim_{n/N\to 0}\epsilon_{S,\mathrm{RS}}=0,\qquad \text{for } n<N.

The conjecture formalizes the observed convergence of strategy performance to random behavior when the total number of boxes becomes large in the unconstrained case, or when the fraction of nonempty boxes becomes small. The supplied text reports only simulations and supporting results, so the conjecture's resolution is not established here.

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.