Problem
Research questions and friction points this paper is trying to address.
subgame perfect equilibria
graph games
omega-recognizable
preference relations
Subgame Perfection in Graph Games with $ω$-Recognizable Preference Relations
🤖 AI Summary
本文研究了多人图游戏中子博弈完美均衡的存在性问题，通过假设每个玩家的偏好关系为ω-可识别来解决，证明了该问题是EXPTIME-完全的。
📝 Abstract
This paper investigates the constrained existence problem for subgame perfect equilibria (SPEs) in multiplayer graph games. In the proposed framework, each player has a preference relation over the set of plays, assumed to be $ω$-recognizable. Equivalently, he has a preference relation over a finite set of payoffs, and the set of plays with the same payoff is $ω$-regular, for each payoff. This generic framework avoids the need to focus on specific payoff functions. We show that the constrained SPE existence problem is EXPTIME-complete, as well as for Nash equilibria (NEs).
Innovation
Methods, ideas, or system contributions that make the work stand out.
subgame perfect equilibria
omega-recognizable preference relations
EXPTIME-complete
🔎 Similar Papers
No similar papers found.
