A characterization of subgame-perfect equilibrium plays in Borel games of perfect information

DOI10.1287/MOOR.2016.0843MaRDI QIDQ4595960zbMATH OpenOpenAlexFDO

Authors Arkadi Predtetchinski, János Flesch

Publication date 7 December 2017

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://cris.maastrichtuniversity.nl/ws/files/35726191/Flesch_2017_Characterization_of_Subgame_Perfect.pdf

zbMATH Keywords

subgame-perfect equilibriumsemicontinuityperfect information games

Mathematics Subject Classification ID

Games in extensive form (91A18) Probabilistic games; gambling (91A60)

Recommendations

• Non-existence of subgame-perfect \(\varepsilon \)-equilibrium in perfect information games with infinite horizon
• Subgame perfection in recursive perfect information games
• On the existence of subgame-perfect equilibrium in infinite-action games of perfect information
• Perfect information games with upper semicontinuous payoffs
• Perfect-information games with lower-semicontinuous payoffs

Cited in

(10)

• On the existence of weak subgame perfect equilibria
• Stochastic games
• Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete
• On the existence of weak subgame perfect equilibria
• Equilibria in multi-player multi-outcome infinite sequential games
• Subgame-perfect Equilibria in Mean-payoff Games (journal version)
• Parameterized games of perfect information
• Perfect information games where each player acts only once
• A game-theoretic approach for the synthesis of complex systems
• Subgame perfection in recursive perfect information games

This page was built for publication: A characterization of subgame-perfect equilibrium plays in Borel games of perfect information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4595960)