Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
956692 | Journal of Economic Theory | 2016 | 11 Pages |
Abstract
We study the class of potential games that are also graphical games with respect to a given graph G of connections between the players. We show that, up to strategic equivalence, this class of games can be identified with the set of Markov random fields on G. From this characterization, and from the Hammersley–Clifford theorem, it follows that the potentials of such games can be decomposed into local potentials.
Keywords
Related Topics
Social Sciences and Humanities
Economics, Econometrics and Finance
Economics and Econometrics
Authors
Yakov Babichenko, Omer Tamuz,