Graphical potential games

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...

Full description

Saved in:
Bibliographic Details
Published in:Journal of economic theory 2016-05, Vol.163, p.889-899
Main Authors: Babichenko, Yakov, Tamuz, Omer
Format: Article
Language:English
Subjects:
Economic theory
Game theory
Graph representations
Graphical games
Markov analysis
Potential games
Studies
Theorems
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0022-0531
1095-7235
DOI:10.1016/j.jet.2016.03.010