pith. sign in

arxiv: 2503.03788 · v2 · submitted 2025-03-05 · 💰 econ.TH

Kuhn's Theorem for Games of the Extensive Form with Unawareness

Pith reviewed 2026-05-23 01:40 UTC · model grok-4.3

classification 💰 econ.TH
keywords Kuhn's theoremextensive form gamesunawarenessperfect recallmixed strategybehavior strategygame theory
0
0 comments X

The pith

In games of extensive form with unawareness, perfect recall implies that every mixed strategy has an equivalent behavior strategy.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper extends Kuhn's theorem from standard games to those where players may be unaware of some aspects of the game. It shows that under perfect recall, mixed strategies can still be matched by behavior strategies. This equivalence matters because it allows analysts to use simpler strategy representations even when awareness is incomplete. The result requires that awareness stays constant along any path of play and an extra condition to prevent false beliefs about events the player is unaware of.

Core claim

If a game of the extensive form with unawareness has perfect recall, then for each mixed strategy there is an equivalent behavior strategy. The converse does not hold without restricting the evolution of the player's awareness to constant awareness along paths of play. Both directions require a condition complementary to perfect recall that rules out falsely believing in some events when the player is unaware of the actual past events.

What carries the argument

The equivalence between mixed strategies and behavior strategies, extended via perfect recall to games with unawareness.

If this is right

  • Mixed strategies remain interchangeable with behavior strategies in the presence of unawareness when perfect recall holds.
  • The equivalence fails if awareness changes along paths of play.
  • An additional condition beyond perfect recall is necessary to handle cases of unawareness properly.
  • Standard analysis techniques relying on behavior strategies apply to these extended games under the stated conditions.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • This suggests that many existing results in game theory that depend on Kuhn's theorem can be carried over to settings with unawareness.
  • Future work could explore how this affects equilibrium concepts in games where awareness evolves.
  • Testable extensions might involve constructing specific game trees with varying awareness to verify the equivalence.

Load-bearing premise

The assumption that a player's awareness remains constant along any path of play, together with a condition that prevents false beliefs about unaware events.

What would settle it

A counterexample game with perfect recall but changing awareness along a path where a mixed strategy has no equivalent behavior strategy would falsify the main claim.

Figures

Figures reproduced from arXiv: 2503.03788 by Burkhard C. Schipper, Ki Vin Foo.

Figure 1
Figure 1. Figure 1: Property 0 Subtree T ′′ on the other hand satisfies Property 0, because even though there is no copy of n ′ in T ′′, there is also no copy of n ′′ in T ′′ . Next, we illustrate Property 1 in [PITH_FULL_IMAGE:figures/full_fig_p006_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Property 1 Within the family T of subtrees of T¯, some nodes n appear in several trees T ∈ T. In what follows, we will need to designate explicitly appearances of such nodes n in different trees as 6 [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Properties U0 and U1 Central to our extension of Kuhn’s Theorem is the condition of perfect recall (I6). I6 Perfect recall: Suppose that player i is active in two distinct nodes n1 and nk, and there is a path n1, n2, ..., nk such that at n1 player i takes the action ai . If n ′ ∈ hi (nk), then there exists a node n ′ 1 ̸= n ′ and a path n ′ 1 , n′ 2 , ..., n′ ℓ = n ′ such that hi (n ′ 1 ) = hi (n1) and at … view at source ↗
Figure 4
Figure 4. Figure 4: Perfect Recall Example We provide two alternate characterizations of the perfect recall condition. First, perfect recall can be interpreted as players do not forget their experience throughout the game. This can be made explicit. For any player i ∈ I and decision node of that player n ∈ Di , let Ei(n) denote the record of player i’s experience along the path to n (not including hi(n)). I.e., Ei(n) is the s… view at source ↗
Figure 5
Figure 5. Figure 5: Perfect Recall Counterexamples information sets in order of how they are encountered along the path to n. Perfect recall is now characterized as follows: Remark 1 A game of the extensive form with unawareness satisfies perfect recall (I6) if and only if for any player i ∈ I, n ∈ Di, n ′ ∈ hi(n) implies Ei(n ′ ) = Ei(n). Proof. “⇒”: Consider the non-trivial case n ′ ̸= n. Suppose by contradiction that Ei(n … view at source ↗
Figure 6
Figure 6. Figure 6: Properties U3 to U5 For trees T, T′ ∈ T we denote by T ↣ T ′ whenever for some node n ∈ T and some player i ∈ P(n) it is the case that hi(n) ⊆ T ′ . Denote by ,→ the transitive closure of ↣. That is, T ,→ T ′′ if and only if there is a sequence of trees T, T′ , . . . , T′′ ∈ T satisfying T ↣ T ′ ↣ · · · ↣ T ′′ . A game of the extensive form with unawareness Γ consists of a join-semilattice T of subtrees of… view at source ↗
Figure 7
Figure 7. Figure 7: Action induced by a strategy In a game of the extensive form with unawareness Γ the tree T¯ ∈ T represents the physical paths in the game; every tree in T that contains an information set represents the subjective view of the feasible paths in the mind of a player, or the view of the feasible paths that a player believes that another player may have in mind, etc. Moreover, as the actual play in T¯ unfolds,… view at source ↗
Figure 8
Figure 8. Figure 8: Counterexample for the converse of Theorem 1 [PITH_FULL_IMAGE:figures/full_fig_p020_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Illustration of Occur vs. Reached The following two examples will help to clarify the definition and its difference to the notion 22 [PITH_FULL_IMAGE:figures/full_fig_p022_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Another Illustration of Occur vs. Reached [PITH_FULL_IMAGE:figures/full_fig_p023_10.png] view at source ↗
Figure 9
Figure 9. Figure 9: Further, let s1 ascribe action “left” in tree T¯ and “right” in tree T. Moreover, let s ′ 1 ascribe action “left” both in tree T¯ and T. Then information set h occurs both with s1 and s ′ 1 . In fact, O(s1, s−1) = O(s ′ 1 , s−1) for any s1 ∈ S1. Yet, only strategy s ′ 1 reaches h in T while s1 reaches h ′ in T. □ For any node n, any player i ∈ I 0 , and any opponents’ profile of strategies s−i (including n… view at source ↗
read the original abstract

We extend Kuhn's Theorem to games of the extensive form with unawareness. We prove that if a game of the extensive form with unawareness has perfect recall, then for each mixed strategy there is an equivalent behavior strategy. We show that the converse does not hold under unawareness without restricting the evolution of the player's awareness to constant awareness along paths of play. Both directions of Kuhn's Theorem for games of the extensive form with unawareness require a condition complementary to perfect recall that rules out falsely believing in some events when the player is unaware of the actual past events.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The paper extends Kuhn's theorem to extensive-form games with unawareness. It proves that perfect recall implies every mixed strategy has an equivalent behavior strategy. The converse fails without restricting awareness evolution to be constant along paths of play. Both directions require an additional condition (complementary to perfect recall) that rules out false beliefs about events of which the player is unaware.

Significance. If the result holds, the extension supplies a foundational equivalence result for strategic analysis in games with evolving unawareness, a setting increasingly used in epistemic game theory and applied models of incomplete information. The explicit qualification of the additional awareness restrictions is a strength, as is the clear separation of the two directions of the theorem.

minor comments (2)
  1. The abstract and introduction state the two auxiliary conditions on awareness evolution, but the manuscript would benefit from a dedicated subsection (perhaps after the definition of the game) that collects all maintained assumptions in one place with forward references to where each is used in the proofs.
  2. Notation for information sets and awareness partitions is introduced gradually; a single table or diagram summarizing the relationship between the standard extensive-form objects and their unawareness-augmented counterparts would improve readability.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the careful reading and positive assessment of the paper. The referee's summary accurately reflects the main results. No specific major comments were provided in the report.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper presents a mathematical extension of Kuhn's 1953 theorem to extensive-form games with unawareness, proving equivalence of mixed and behavior strategies under perfect recall plus explicit additional restrictions on awareness evolution. No steps reduce by construction to fitted parameters, self-definitions, or load-bearing self-citations; the central claim is a direct proof whose assumptions are stated explicitly and do not presuppose the result. The derivation is self-contained against the external benchmark of standard Kuhn's theorem.

Axiom & Free-Parameter Ledger

0 free parameters · 3 axioms · 0 invented entities

Review based on abstract only; the paper invokes the standard definition of perfect recall and introduces two new domain restrictions on awareness evolution and belief formation.

axioms (3)
  • domain assumption Perfect recall in extensive-form games
    Standard background assumption required for the forward direction of Kuhn's Theorem.
  • ad hoc to paper Constant awareness along paths of play
    Explicitly required by the abstract for the converse to hold.
  • ad hoc to paper No false beliefs about unaware events
    Complementary condition stated in the abstract for both directions.

pith-pipeline@v0.9.0 · 5618 in / 1250 out tokens · 43767 ms · 2026-05-23T01:40:03.993105+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

34 extracted references · 34 canonical work pages

  1. [1]

    Battigalli, P. (1997). On rationalizability in extensive games, Journal of Economic Theory 74, 40–61

  2. [2]

    Battigalli, P. and D. Bordoli (2024). Sophisticated reasoning, learning, and equilibrium in repeated games with imperfect feedback, Economic Theory, forthcoming

  3. [3]

    Battigalli, P. and N. De Vito (2021). Beliefs, plans, and perceived intentions in dynamic games, Journal of Economic Theory 195, 105283

  4. [4]

    Battigalli, P. and D. Guaitoli (1997). Conjectural equilibria and rationalizability in a game with incomplete information, in: Battigalli, P., Montesano, A., and F. Panunzi (eds.),Decisions, games and markets, Dordrecht: Kluwer Academic Publishers, 97–124

  5. [5]

    Dubey, P. and M. Kaneko (1984). Information patterns and Nash equilibria in games of the extensive form: I, Mathematical Social Sciences 8, 111-139

  6. [6]

    Fagin, R. and J. Halpern (1988). Belief, awareness, and limited reasoning, Artificial Intel- ligence 34, 39–76

  7. [7]

    Feinberg, Y. (2021). Games with unawareness, B.E. Journal of Theoretical Economics 21, 433–488

  8. [8]

    Filiz-Ozbay, E. (2012). Incorporating unawareness into contract theory, Games and Eco- nomic Behavior 76, 181–194

  9. [9]

    Francetich, A. and B.C. Schipper (2024). Rationalizable screening and disclosure under unawareness, University of California, Davis

  10. [10]

    Grant, S. and J. Quiggin (2013). Inductive reasoning about unawareness, Economic Theory 54, 717–755. 27

  11. [11]

    Halpern, J. and L.C. Rˆ ego (2014). Games of the extensive form with possibly unaware players, Mathematical Social Sciences 70, 42–58

  12. [12]

    Schipper (2021)

    Heifetz, A., Meier, M., and B.C. Schipper (2021). Prudent rationalizability in generalized extensive-form games with unawareness, B.E. Journal of Theoretical Economics 21, 525– 556

  13. [13]

    Schipper (2013)

    Heifetz, A., Meier, M., and B.C. Schipper (2013). Dynamic unawareness and rationalizable behavior, Games and Economic Behavior 81, 50–68

  14. [14]

    Heifetz, A., Meier, M. and B.C. Schipper (2006). Interactive unawareness, Journal of Eco- nomic Theory 130, 78–94

  15. [15]

    Kuhn, H.W. (2002). Lectures on the theory of games, Annals of Mathematical Studies No. 37, Princeton University Press

  16. [16]

    Kuhn, H.W. (1953). games of the extensive form and the problem of information, in: Kuhn, H.W. and A.W. Tucker (eds.), Contributions to the Theory of Games, Vol. II, Annals of Mathematical Studies No. 28, Princeton University Press, Chapter 3, 193–216

  17. [17]

    Li, Y.X. and B.C. Schipper (2024). Disclosure under unawareness: An experiment, Uni- versity of California, Davis

  18. [18]

    Luce, R. D. and H. Raiffa (1957). Games and decisions: Introduction and critical survey, Wiley & Sons

  19. [19]

    Zamir (2013)

    Maschler, M., Solan, E., and S. Zamir (2013). Game theory, Cambridge University Press

  20. [20]

    Meier, M. and B.C. Schipper (2024). Conditional dominance in games with unawareness, University of California, Davis

  21. [21]

    Ozbay, E. (2007). Unawareness and strategic announcements in games with uncertainty, in: Samet, D. (ed.), Proceedings of the 11th conference on Theoretical Aspects of Rationality and Knowledge,Presses Universitaires de Louvain, 231–238

  22. [22]

    Osborne, M. and A. Rubinstein (1994). A course in game theory, MIT Press

  23. [23]

    Pearce, D.G. (1984). Rationalizable strategic behavior and the problem of perfection, Econometrica 52, 1029–1050

  24. [24]

    Piccione, M. and A. Rubinstein (1997). On the interpretation of decision problems with imperfect recall, Games and Economic Behavior 20, 3–24

  25. [25]

    Pram, K. and B.C. Schipper (2025). Efficient mechanisms under unawareness, University of California, Davis. 28

  26. [26]

    Rˆ ego, L. and J. Halpern (2012). Generalized solution concepts in games with possibly unaware players, International Journal of Game Theory 41, 131–155

  27. [27]

    Ritzberger, K. (2002). Foundations of non-cooperative game theory, Oxford University Press

  28. [28]

    Ritzberger, K. (1999). Recall in extensive form games, International Journal of Game Theory 28, 69–87

  29. [29]

    Schipper, B.C. (2025). The unawareness bibliography, https://faculty.econ.ucdavis. edu/faculty/schipper/unaw.htm

  30. [30]

    Schipper, B.C. (2021). Discovery and equilibrium in games with unawareness, Journal of Economic Theory 198, 105365

  31. [31]

    Schipper, B.C. (2014). Unawareness - A gentle introduction to both the special issue and the literature, Mathematical Social Sciences 70, 1–9

  32. [32]

    Schipper, B.C. and H.Y. Woo (2019). Political awareness, microtargeting of voters, and negative electoral campaigning, Quarterly Journal of Political Science 14, 41–88

  33. [33]

    Selten, R. (1975). Reexamination of the perfectness concept for equilibrium points in games of the extensive form, International Journal of Game Theory 4, 25–55

  34. [34]

    Wichardt, P. (2008). Existence of Nash equilibria in finite extensive form games with imperfect recall: A counterexample, Games and Economic Behavior 63, 366–369. 29