On model checking for the &mgr;-calculus and its fragments
Theoretical Computer Science
Infinite Games and Verification (Extended Abstract of a Tutorial)
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Subgame-Perfection in Quitting Games with Perfect Information and Differential Equations
Mathematics of Operations Research
Subgame-Perfect Equilibria for Stochastic Games
Mathematics of Operations Research
Subgame Perfection in Positive Recursive Games with Perfect Information
Mathematics of Operations Research
Perfect Information Games with Upper Semicontinuous Payoffs
Mathematics of Operations Research
Hi-index | 0.00 |
We prove that every multiplayer perfect-information game with bounded and lower-semicontinuous payoffs admits a subgame-perfect ε-equilibrium in pure strategies. This result complements Example 3 in Solan and Vieille [Solan, E., N. Vieille. 2003. Deterministic multi-player Dynkin games. J. Math. Econom.39 911--929], which shows that a subgame-perfect ε-equilibrium in pure strategies need not exist when the payoffs are not lower-semicontinuous. In addition, if the range of payoffs is finite, we characterize in the form of a Folk Theorem the set of all plays and payoffs that are induced by subgame-perfect 0-equilibria in pure strategies.