On the structure of weakly acyclic games

Alex Fabrikant; Aaron D. Jaggard; Michael Schapira

doi:10.1007/978-3-642-16170-4_12

On the structure of weakly acyclic games

Alex Fabrikant^*, Aaron D. Jaggard, Michael Schapira

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

18 Scopus citations

Abstract

The class of weakly acyclic games, which includes potential games and dominance-solvable games, captures many practical application domains. Informally, a weakly acyclic game is one where natural distributed dynamics, such as better-response dynamics, cannot enter inescapable oscillations. We establish a novel link between such games and the existence of pure Nash equilibria in subgames. Specifically, we show that the existence of a unique pure Nash equilibrium in every subgame implies the weak acyclicity of a game. In contrast, the possible existence of multiple pure Nash equilibria in every subgame is insufficient for weak acyclicity.

Original language	English
Title of host publication	Algorithmic Game Theory - Third International Symposium, SAGT 2010, Proceedings
Pages	126-137
Number of pages	12
Edition	M4D
DOIs	https://doi.org/10.1007/978-3-642-16170-4_12
State	Published - 2010
Externally published	Yes
Event	3rd International Symposium on Algorithmic Game Theory, SAGT 2010 - Athens, Greece Duration: 18 Oct 2010 → 20 Oct 2010

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	M4D
Volume	6386 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	3rd International Symposium on Algorithmic Game Theory, SAGT 2010
Country/Territory	Greece
City	Athens
Period	18/10/10 → 20/10/10

Access to Document

10.1007/978-3-642-16170-4_12

Cite this

Fabrikant, A., Jaggard, A. D., & Schapira, M. (2010). On the structure of weakly acyclic games. In Algorithmic Game Theory - Third International Symposium, SAGT 2010, Proceedings (M4D ed., pp. 126-137). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6386 LNCS, No. M4D). https://doi.org/10.1007/978-3-642-16170-4_12

@inproceedings{5fc438a37a1e40cd8934ab02b3c6fcce,

title = "On the structure of weakly acyclic games",

abstract = "The class of weakly acyclic games, which includes potential games and dominance-solvable games, captures many practical application domains. Informally, a weakly acyclic game is one where natural distributed dynamics, such as better-response dynamics, cannot enter inescapable oscillations. We establish a novel link between such games and the existence of pure Nash equilibria in subgames. Specifically, we show that the existence of a unique pure Nash equilibrium in every subgame implies the weak acyclicity of a game. In contrast, the possible existence of multiple pure Nash equilibria in every subgame is insufficient for weak acyclicity.",

author = "Alex Fabrikant and Jaggard, {Aaron D.} and Michael Schapira",

year = "2010",

doi = "10.1007/978-3-642-16170-4_12",

language = "אנגלית",

isbn = "3642161693",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

number = "M4D",

pages = "126--137",

booktitle = "Algorithmic Game Theory - Third International Symposium, SAGT 2010, Proceedings",

edition = "M4D",

note = "3rd International Symposium on Algorithmic Game Theory, SAGT 2010 ; Conference date: 18-10-2010 Through 20-10-2010",

}

Fabrikant, A, Jaggard, AD & Schapira, M 2010, On the structure of weakly acyclic games. in Algorithmic Game Theory - Third International Symposium, SAGT 2010, Proceedings. M4D edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. M4D, vol. 6386 LNCS, pp. 126-137, 3rd International Symposium on Algorithmic Game Theory, SAGT 2010, Athens, Greece, 18/10/10. https://doi.org/10.1007/978-3-642-16170-4_12

On the structure of weakly acyclic games. / Fabrikant, Alex; Jaggard, Aaron D.; Schapira, Michael.
Algorithmic Game Theory - Third International Symposium, SAGT 2010, Proceedings. M4D. ed. 2010. p. 126-137 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6386 LNCS, No. M4D).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On the structure of weakly acyclic games

AU - Fabrikant, Alex

AU - Jaggard, Aaron D.

AU - Schapira, Michael

PY - 2010

Y1 - 2010

N2 - The class of weakly acyclic games, which includes potential games and dominance-solvable games, captures many practical application domains. Informally, a weakly acyclic game is one where natural distributed dynamics, such as better-response dynamics, cannot enter inescapable oscillations. We establish a novel link between such games and the existence of pure Nash equilibria in subgames. Specifically, we show that the existence of a unique pure Nash equilibrium in every subgame implies the weak acyclicity of a game. In contrast, the possible existence of multiple pure Nash equilibria in every subgame is insufficient for weak acyclicity.

AB - The class of weakly acyclic games, which includes potential games and dominance-solvable games, captures many practical application domains. Informally, a weakly acyclic game is one where natural distributed dynamics, such as better-response dynamics, cannot enter inescapable oscillations. We establish a novel link between such games and the existence of pure Nash equilibria in subgames. Specifically, we show that the existence of a unique pure Nash equilibrium in every subgame implies the weak acyclicity of a game. In contrast, the possible existence of multiple pure Nash equilibria in every subgame is insufficient for weak acyclicity.

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

U2 - 10.1007/978-3-642-16170-4_12

DO - 10.1007/978-3-642-16170-4_12

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:78649569407

SN - 3642161693

SN - 9783642161698

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 126

EP - 137

BT - Algorithmic Game Theory - Third International Symposium, SAGT 2010, Proceedings

T2 - 3rd International Symposium on Algorithmic Game Theory, SAGT 2010

Y2 - 18 October 2010 through 20 October 2010

ER -

On the structure of weakly acyclic games

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this