Potential Games on Unimodular Random Graphs

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Neuman, Eyal, Tuschmann, Sturmius
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866914478882291712
author Neuman, Eyal
Tuschmann, Sturmius
author_facet Neuman, Eyal
Tuschmann, Sturmius
contents We study potential games on unimodular random graphs of bounded degree, where players interact through the underlying network. Using the unimodular measure, we define a well-posed global potential that captures both finite- and infinite-player games. A key observation is that the mass-transport principle identifies the first variation of this potential with the first-order condition of a representative (root) player. Under suitable convexity assumptions, we prove that minimizers of the potential coincide with quenched Nash equilibria, and conversely. We also establish the thermodynamic limit of the potential along weakly convergent sequences of unimodular measures. Finally, we present examples with semi-explicit equilibrium descriptions. In linear-quadratic games on unimodular graphs, equilibria are expressed in terms of the Green kernel of the simple random walk operator, while in convex settings, equilibria are characterized by solutions to nonlinear Poisson equations.
format Preprint
id arxiv_https___arxiv_org_abs_2604_13836
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Potential Games on Unimodular Random Graphs
Neuman, Eyal
Tuschmann, Sturmius
Optimization and Control
Probability
91A07, 91A43, 93E20
We study potential games on unimodular random graphs of bounded degree, where players interact through the underlying network. Using the unimodular measure, we define a well-posed global potential that captures both finite- and infinite-player games. A key observation is that the mass-transport principle identifies the first variation of this potential with the first-order condition of a representative (root) player. Under suitable convexity assumptions, we prove that minimizers of the potential coincide with quenched Nash equilibria, and conversely. We also establish the thermodynamic limit of the potential along weakly convergent sequences of unimodular measures. Finally, we present examples with semi-explicit equilibrium descriptions. In linear-quadratic games on unimodular graphs, equilibria are expressed in terms of the Green kernel of the simple random walk operator, while in convex settings, equilibria are characterized by solutions to nonlinear Poisson equations.
title Potential Games on Unimodular Random Graphs
topic Optimization and Control
Probability
91A07, 91A43, 93E20
url https://arxiv.org/abs/2604.13836