Exact count conjecture for time-invariant Nash equilibria

From papers

Let Q:(0,)NQ:(0,\infty)\to\mathbb{N} denote the maximum cardinality of a set of mutually shift-inequivalent time-invariant Nash equilibria for the game Standard(x)\operatorname{Standard}(x), and let λ\lambda be the endpoint parameter for the admissible Mina-margin interval. Exact-count conjecture.

Q(x)=2when x(λ,λ1),Q(x)=1when x{λ,λ1}.Q(x)=2\quad\text{when }x\in(\lambda,\lambda^{-1}),\qquad Q(x)=1\quad\text{when }x\in\{\lambda,\lambda^{-1}\}.

This refines the preceding existence result by asserting uniqueness up to shift in the interior and at both endpoints; the supplied text gives no resolution.

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

Alan Hammond, “On the Trail of Lost Pennies: player-funded tug-of-war on the integers”, arXiv:2209.07451 (2026).

Solutions 0

No solutions have been posted yet.