Ising Game on Graphs
Andrey Leonidov, Alexey Savvateev, Andrew G. Semenov

TL;DR
This paper analyzes static and dynamic equilibria in noisy binary choice (Ising) games on graphs, revealing hysteresis phenomena and showing that reduced models align with full Ising models, connecting game theory with statistical physics.
Contribution
It introduces a detailed analysis of equilibria and hysteresis in Ising games on graphs, linking game dynamics with statistical physics models.
Findings
Static and dynamic equilibria are characterized and linked.
Hysteresis phenomena influence equilibrium patterns.
Results for reduced and full Ising games coincide.
Abstract
Static and dynamic equilibria in noisy binary choice (Ising) games on complete and random graphs in the annealed approximation are analysed. Two versions, an Ising game with interaction term defined in accordance with the Ising model in statistical physics and a reduced Ising game with a customary definition of interaction term in game theory on graphs, are considered. A detailed analysis of hysteresis phenomenon shaping the pattern of static equilibria based on consideration of elasticity with respect to external influence is conducted. Fokker-Planck equations describing dynamic versions of the games under consideration are written and their asymptotic stationary solutions derived. It is shown that domains of parameters corresponding to the maxima of these probability distributions are identical with the corresponding hysteresis ranges for static equilibria. Same result holds for…
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.
