Best response cycles in perfect information games
P. Jean-Jacques Herings and
No 17, Research Memorandum from Maastricht University, Graduate School of Business and Economics (GSBE)
We consider n-player perfect information games with payofffunctions having a finite image. We do not make any further assumptions, so in particular we refrain from making assumptions on the cardinality or the topology of the set of actions and assumptions like continuity or measurability of payofffunctions. We show that there exists a best response cycle of length four, that is, a sequence (σ0, σ1, σ2, σ3, σ0) of pure strategy profiles where every successive element is a best response to the previous one. This result implies the existence of point-rationalizable strategy profiles. When payoffs are only required to be bounded, we show the existence of an ϵ-best response cycle of length four for every ϵ > 0.
New Economics Papers: this item is included in nep-gth and nep-hpe
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
https://cris.maastrichtuniversity.nl/ws/files/1241 ... 5e9bd3e-ASSET1.0.pdf (application/pdf)
Journal Article: Best-Response Cycles in Perfect Information Games (2017)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:unm:umagsb:2015017
Access Statistics for this paper
More papers in Research Memorandum from Maastricht University, Graduate School of Business and Economics (GSBE) Contact information at EDIRC.
Bibliographic data for series maintained by Andrea Willems () and Leonne Portz ().