We introduce an operation, called compactification, to reduce an extensive form to a compact one where each decision node in the game tree can be assigned to more than one player. Motivated by Thompson (1952)'s interchange of decision nodes, we attempt to capture the notion of a faithful representation of the chronological order of the moves in a dynamic game which plays a vital role in fields like epistemic game theory. The compactification process preserves perfect recall and the unambiguity of the order among information sets. We specify an algorithm, called leaves-to-root process, which compactifies at least as many information sets as any other compactification process. The compact extensive form provides an approach to avoid problems in dynamic game theory due to the vague definition of the chronological order of the moves, for example, belief in the opponents' future rationality ( Perea ( 2014))'s sensitivity to the specific extensive form representation. We show that any strategy which can rationally be chosen under common belief in future rationality in a minimal compact game if and only if it satisfies this property in every extensive form game which is related to it via some compactification process .
We study the relationship between invariant transformations on extensive game structures and backward dominance procedure (BD), a generalization of the classical backward induction introduced in Perea ( 2014). We show that behavioral equivalence with unambiguous orderings of information sets, a critical property that guarantees BD's applicability, can be characterized by the classical Coalescing and a modified Interchange/Simultanizing in Battigalli et al. (2020). We also give conditions on transformations that improve BD's efficiency. In addition, we discuss the relationship between transformations and Bonanno (2014)'s generalized backward induction .
R
introduce an operation, called compactification, to reduce an extensive form to a compact one where each decision node in the game tree can be assigned to more than one player. Motivated by Thompson (1952)'s interchange of decision nodes, we attempt to capture the notion of a faithful representation of the chronological order of the moves in a dynamic game which plays a vital role in fields like epistemic game theory. The compactification process preserves perfect recall and the unambiguity of the order among information sets. We specify an algorithm, called leaves-to-root process, which compactifies at least as many information sets as any other compactification process. The compact extensive form provides an approach to avoid problems in dynamic game theory due to the vague definition of the chronological order of the moves, for example, belief in the opponents' future rationality (
study the relationship between invariant transformations on extensive game structures and backward dominance procedure (BD), a generalization of the classical backward induction introduced in
R
2014))'s sensitivity to the specific extensive form representation. We show that any strategy which can rationally be chosen under common belief in future rationality in a minimal compact game if and only if it satisfies this property in every extensive form game which is related to it via some compactification process
2014). We show that behavioral equivalence with unambiguous orderings of information sets, a critical property that guarantees BD's applicability, can be characterized by the classical Coalescing and a modified Interchange/Simultanizing in Battigalli et al. (2020). We also give conditions on transformations that improve BD's efficiency. In addition, we discuss the relationship between transformations and Bonanno (2014)'s generalized backward induction