Equilibrium-count conjecture for symmetric finite trails
Statement
Consider the Trail of Lost Pennies on the finite trail in its symmetric standard form. Finite-trail equilibrium-count conjecture. The number of time-invariant Nash equilibria equals
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.