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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Writing-RL: Advancing Long-form Writing via Adaptive Curriculum Reinforcement Learning
SuperWriter: Reflection-Driven Long-Form Generation with Large Language Models
How Does Response Length Affect Long-Form Factuality
MedScore: Factuality Evaluation of Free-Form Medical Answers
Frankentext: Stitching random text fragments into long-form narratives
Teaching Large Language Models to Maintain Contextual Faithfulness via Synthetic Tasks and Reinforcement Learning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.