A Characterization of Subgame-Perfect Equilibrium Plays in Borel Games of Perfect Information [PDF]
Mathematics of Operations Research, 2017 We provide a characterization of subgame-perfect equilibrium plays in a class of perfect information games where each player’s payoff function is Borel measurable and has finite range. The set of subgame-perfect equilibrium plays is obtained through a process of iterative elimination of plays.
János Flesch, Arkadi Predtetchinski
openalex +3 more sources
On refinements of subgame perfect $$\epsilon $$ ϵ -equilibrium [PDF]
International Journal of Game Theory, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
János Flesch, Arkadi Predtetchinski
openalex +4 more sources
Subgame-perfect equilibrium strategies for time-inconsistent recursive stochastic control problems [PDF]
Journal of Mathematical Analysis and Applications, 2023 arXiv admin note: substantial text overlap with arXiv:2105 ...
Elisa Mastrogiacomo, Marco Tarsia
+6 more sources
Infinite Subgame Perfect Equilibrium in the Hausdorff Difference Hierarchy [PDF]
, 2016 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.
Stéphane Le Roux
openalex +4 more sources
Non-existence of subgame-perfect $$\varepsilon $$ ε -equilibrium in perfect information games with infinite horizon [PDF]
International Journal of Game Theory, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
János Flesch +6 more
+5 more sources
An Approximate Subgame-Perfect Equilibrium Computation Technique for Repeated Games
Proceedings of the AAAI Conference on Artificial Intelligence, 2010 This paper presents a technique for approximating, up to any precision, the set of subgame-perfect equilibria (SPE) in repeated games with discounting. The process starts with a single hypercube approximation of the set of SPE payoff profiles. Then the initial hypercube is gradually partitioned on to a set of smaller adjacent hypercubes,
Andriy Burkov, Brahim Chaib-draa
openalex +4 more sources
Playing Extensive Games with Learning of Opponent’s Cognition [PDF]
SensorsDecision-making is a basic component of agents’ (e.g., intelligent sensors) behaviors, in which one’s cognition plays a crucial role in the process and outcome.
Chanjuan Liu +3 more
doaj +2 more sources
Solution of mathematical programming formulations of subgame perfect equilibrium problems [PDF]
, 1992 Mathematical programming models have been developed to represent imperfectly competitive (oligopolistic) market structures and the interdependencies of decision-making units in establishing prices and production levels. The solution of these models represents an economic equilibrium.
C.M. Macal, Arthur P. Hurter
openalex +4 more sources
Computing the Subgame Perfect Nash Equilibriums in Parallel Allocation Indivisible Items
Journal of Physics: Conference Series, 2020 Abstract Multi-Agent resource allocation has also become a research hotspot in the field of artificial intelligence in recent years. A lot of related work aims to design a procedural resource allocation system with execution efficiency.
Wei Huang +5 more
openalex +2 more sources
Persistent Unemployment as Subgame Perfect Equilibrium
, 1987 The present paper develops some game-theoretic models of a labour market with l firm and n equally productive workers. Although all agents are rational and well-informed, and each of them acts strategically in his own best interest (including the monopsonist firm), unemployment may persist in (subgame perfect) equilibrium for certain combinations of ...
Jörgen W. Weibull
openalex +2 more sources