Elliptic curves in game theory
Abhiram Kidambi, Elke Neuhaus, Irem Portakal

TL;DR
This paper studies Spohn curves, elliptic curves arising from game theory models, analyzing their geometric properties, reducibility, and invariants to classify game equilibria.
Contribution
It provides a full classification of Spohn curves' reducibility, analyzes their real points, and introduces a $j$-invariant based equivalence for $2\times 2$ games.
Findings
Real points are dense on Spohn curves in all cases.
Classification of conditions for reducibility of Spohn curves.
Methodology for computing $j$-invariants of intersection elliptic curves.
Abstract
We investigate Spohn curves, the algebro-geometric models of totally mixed dependency equilibria for normal-form games. These curves arise as the intersection of two quadrics in and are generically elliptic curves. We examine the reduction of Spohn curves to plane curves, providing a full classification of conditions under which they are reducible. Notably, we prove that the real points are dense on the Spohn curve in all cases, which is relevant for applications. These computations are further supported by Macaulay2 and stored in Mathrepo. We review methods to compute the -invariants of elliptic curves arising as the intersection of quadrics in which we apply to the case of Spohn curves aimed at game theorists. We propose a definition of equivalence of generic games based on the -invariant of the Spohn curve.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Advanced Differential Equations and Dynamical Systems · Advanced Numerical Analysis Techniques
