Skip to Main content Skip to Navigation
Conference papers

Infinite Subgame Perfect Equilibrium in the Hausdorff Difference Hierarchy

Abstract : Subgame perfect equilibria are specific Nash equilibria in perfect information games in extensive form. They are important because they relate to the rationality of the players. They always exist in infinite games with continuous real-valued payoffs, but may fail to exist even in simple games with slightly discontinuous payoffs. This article considers only games whose outcome functions are measurable in the Hausdorff difference hierarchy of the open sets (i.e. ${ {\Delta }}^0_2$ when in the Baire space), and it characterizes the families of linear preferences such that every game using these preferences has a subgame perfect equilibrium: the preferences without infinite ascending chains (of course), and such that for all players a and b and outcomes x, y, z we have $\lnot (z <_a y <_a x \,\wedge \, x <_b z <_b y)$. Moreover at each node of the game, the equilibrium constructed for the proof is Pareto-optimal among all the outcomes occurring in the subgame. Additional results for non-linear preferences are presented.
Document type :
Conference papers
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Wednesday, January 25, 2017 - 4:50:41 PM
Last modification on : Wednesday, November 3, 2021 - 6:23:14 AM
Long-term archiving on: : Wednesday, April 26, 2017 - 6:34:54 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Stéphane Le Roux. Infinite Subgame Perfect Equilibrium in the Hausdorff Difference Hierarchy. 1st International Conference on Theoretical Computer Science (TTCS), Aug 2015, Tehran, Iran. pp.147-163, ⟨10.1007/978-3-319-28678-5_11⟩. ⟨hal-01446258⟩



Record views


Files downloads