UNCOUPLED AUTOMATA AND PURE NASH EQUILIBRIA

Yakov Babichenko

Chapter 9 in Simple Adaptive Strategies:From Regret-Matching to Uncoupled Dynamics, 2013, pp 191-214 from World Scientific Publishing Co. Pte. Ltd.

Abstract: AbstractWe study the problem of reaching a pure Nash equilibrium in multi-person games that are repeatedly played under the assumption of uncoupledness: every player knows only his own payoff function. We consider strategies that can be implemented by finite-state automata, and characterize the minimal number of states needed in order to guarantee that a pure Nash equilibrium is reached in every game where such an equilibrium exists.

Keywords: Game Theory; Dynamics; Equilibrium; Nash Equilibrium; Correlated Equilibrium; Adaptive Dynamics; Simple Strategies; Regret-Based Strategies; Uncoupled Dynamics; Bounded Rationality (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.worldscientific.com/doi/pdf/10.1142/9789814390705_0009 (application/pdf)
https://www.worldscientific.com/doi/abs/10.1142/9789814390705_0009 (text/html)
Ebook Access is available upon purchase.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:wschap:9789814390705_0009

Ordering information: This item can be ordered from

Access Statistics for this chapter

More chapters in World Scientific Book Chapters from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().