Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published May 2016 | Submitted
Journal Article Open

Graphical potential games

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.

Additional Information

© 2016 Elsevier Inc. Received 20 October 2015; final version received 8 February 2016; accepted 18 March 2016; Available online 23 March 2016. The authors would like to thank Elchanan Mossel for some enlightening comments.

Attached Files

Submitted - 1405.1481v2.pdf

Files

1405.1481v2.pdf
Files (242.9 kB)
Name Size Download all
md5:3d90461ca5fd91210756c1e3524d8aa2
242.9 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 18, 2023