Kuhn's Theorem for Games of the Extensive Form with Unawareness
We extend Kuhn's Theorem to games of the extensive form with unawareness. This extension is not obvious: First, games of the extensive form with non-trivial unawareness involve a forest of partially ordered game trees rather than just one game tree. An information set at a node in one tree may consist of nodes in a less expressive tree. Consequently, perfect recall takes a more complicated form as players may also become aware of new actions during the play. Second, strategies can only be partially an object of ex ante choice in games with unawareness. Finally, nodes that a player may expect to reach with a strategy profile may not be the nodes that actually occur with this strategy profile, requiring us to define appropriate notions of equivalence of strategies. We show if a game of the extensive form with unawareness has perfect recall, then for each mixed strategy there is an equivalent behavior strategy but the converse does not hold under unawareness.
Code (0)
등록된 구현이 없습니다.
Tasks
FormMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
A partial-state space model of unawareness
We propose a model of unawareness that remains close to the paradigm of Aumann's model for knowledge [R. J. Aumann, International Journal of Game Theory 28 (1999) 263-300]: just as Aumann uses a correspondence on a state…
modelStandard State Space Models of Unawareness (Extended Abstract)
The impossibility theorem of Dekel, Lipman and Rustichini has been thought to demonstrate that standard state-space models cannot be used to represent unawareness. We first show that Dekel, Lipman and Rustichini do not e…
State Space ModelsA Characterization of Nash Equilibrium in Behavioral Strategies through Local Sequential Rationality
The concept of Nash equilibrium in behavioral strategies (NashEBS) was formulated By Nash~\cite{Nash (1951)} for an extensive-form game through global rationality of nonconvex payoff functions. Kuhn's payoff equivalence …
FormNeural Auto-Curricula in Two-Player Zero-Sum Games
When solving two-player zero-sum games, multi-agent reinforcement learning (MARL) algorithms often create populations of agents where, at each iteration, a new agent is discovered as the best response to a mixture over t…
Multi-agent Reinforcement LearningVocal Bursts Valence PredictionWhich Nash Equilibrium? Solver-Dependent Selection on Zero-Sum Nash Polytopes
Many two-player zero-sum games admit not a unique Nash equilibrium but a convex set of them: a polytope of profiles that all share the minimax value V* yet prescribe different behaviour. Standard solvers each converge to…