Graphical potential games

Yakov Babichenko; Omer Tamuz

doi:10.1016/j.jet.2016.03.010

Graphical potential games

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	889-899
Number of pages	11
Journal	Journal of Economic Theory
Volume	163
DOIs	https://doi.org/10.1016/j.jet.2016.03.010
State	Published - 1 May 2016
Externally published	Yes

Keywords

Graphical games
Potential games

All Science Journal Classification (ASJC) codes

Economics and Econometrics

Access to Document

10.1016/j.jet.2016.03.010

Cite this

@article{0a751a0955e4474397cdd92720f4592a,

title = "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.",

keywords = "Graphical games, Potential games",

author = "Yakov Babichenko and Omer Tamuz",

note = "Publisher Copyright: {\textcopyright} 2016 Elsevier Inc..",

year = "2016",

month = may,

day = "1",

doi = "10.1016/j.jet.2016.03.010",

language = "الإنجليزيّة",

volume = "163",

pages = "889--899",

journal = "Journal of Economic Theory",

issn = "0022-0531",

publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - Graphical potential games

AU - Babichenko, Yakov

AU - Tamuz, Omer

PY - 2016/5/1

Y1 - 2016/5/1

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

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

KW - Graphical games

KW - Potential games

UR - http://www.scopus.com/inward/record.url?scp=84961783399&partnerID=8YFLogxK

U2 - 10.1016/j.jet.2016.03.010

DO - 10.1016/j.jet.2016.03.010

M3 - مقالة

SN - 0022-0531

VL - 163

SP - 889

EP - 899

JO - Journal of Economic Theory

JF - Journal of Economic Theory

ER -

Graphical potential games

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this