Convergence-to-random conjecture for properly bounded prisoner strategies
Statement
Let be a properly bounded strategy, let denote the random strategy, and let be the metric distance between their P-functions for parameters and . Let 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 other than , its P-function converges to that of the random strategy in the following senses:
and
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.