ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider the Trail of Lost Pennies on the finite trail ⟦−j−1,k+1⟧\llbracket -j-1,k+1\rrbracket in its symmetric standard form. Finite-trail equilibrium-count conjecture. The number of time-invariant Nash equilibria equals

max⁡{2(j+k)−5,1}.\max\{2(j+k)-5,1\}.

The formula is presented as a conjecture about the effect of reflection symmetries on the finite-trail game; no proof or resolution is supplied in the text.

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.