Bounded-rational agents on networks reach higher stationary coordination probability when connectivity is uniform, with the probability increasing in rationality parameter beta and the partition function approximable by a Gaussian moment-generating function to show regular networks are optimal.
Ising game on graphs,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Learning to Coordinate over Networks with Bounded Rationality
Bounded-rational agents on networks reach higher stationary coordination probability when connectivity is uniform, with the probability increasing in rationality parameter beta and the partition function approximable by a Gaussian moment-generating function to show regular networks are optimal.