Papers › Quantal Response Equilibria in Binary Choice Games on Graphs
Quantal Response Equilibria in Binary Choice Games on Graphs
Andrey Leonidov, Alexey Savvateev, Andrew G. Semenov
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Static and dynamic equilibria in noisy binary choice games on graphs are considered. Equations defining static quantal response equilibria (QRE) for binary choice games on graphs with arbitrary topology and noise distribution are written. It is shown that in the special cases of complete graph and arbitrary noise distribution, and circular and star topology and logistic noise distribution the resulting equations can be cast in the form coinciding with that derived in the earlier literature. Explicit equations QRE for non-directed graphs in the annealed approximation are derived. It is shown that the resulting effect on the phase transition is the same as found in the literature on phase transition in the Ising model on graphs in the same approximation.Evolutionary noisy binary choice game having the earlier described QRE as its stationary equilibria in the mean field approximation is constructed using the formalism of master equation.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections