Minimizers of a unimodular potential on random graphs coincide with quenched Nash equilibria under convexity assumptions, with thermodynamic limits and semi-explicit solutions via Green kernels or nonlinear Poisson equations.
Lovász.Large Networks and Graph Limits
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Potential Games on Unimodular Random Graphs
Minimizers of a unimodular potential on random graphs coincide with quenched Nash equilibria under convexity assumptions, with thermodynamic limits and semi-explicit solutions via Green kernels or nonlinear Poisson equations.