We introduce a general class of simplicity standards that vary the foresight abilities required of agents in extensive-form games. Rather than planning for the entire future of a game, agents are presumed to be able to plan only for those histories they view as simple from their current...

We introduce a general class of simplicity standards that vary the foresight abilities required of agents in extensive-form games. Rather than planning for the entire future of a game, agents are presumed to be able to plan only for those histories they view as simple from their current...

Heifetz, Meier and Schipper (2013) introduced generalized extensive-form games that allow for asymmetric unawareness. Here, we study the normal form of a generalized extensiveform game. The generalized normal-form game associated to a generalized extensive-form game with unawareness may consist...

We define generalized extensive-form games which allow for mutual unawareness of actions. We extend Pearce's (1984) notion of extensive-form (correlated) rationalizability to this setting, explore its properties and prove existence. We define also a new variant of this solution concept, prudent...

We define generalized extensive-form games which allow for mutual unawareness of actions. We extend Pearce's (1984) notion of extensive-form (correlated) rationalizability to this setting, explore its properties and prove existence.

We define an extensive-form analogue of iterated admissibility, called Prudent Rationalizability (PR). In each round of the procedure, for each information set of a player a surviving strategy of hers is required to be rational vis-a-vis a belief system with a full-support belief on the...

We define generalized extensive-form games which allow for mutual unawareness of actions. We extend Pearce's (1984) notion of extensive-form (correlated) rationalizability to this setting, explore its properties and prove existence. We define also a new variant of this solution concept, prudent...

We define an extensive-form analogue of iterated admissibility, called Prudent Rationalizability (PR). In each round of the procedure, for each information set of a player a surviving strategy of hers is required to be rational vis-a-vis a belief system with a full-support belief on the...

We prove that the structure theorem for rationalizability originally from Weinstein and Yildiz (2007) applies to any finite extensive-form game with perfect recall and suitably rich payoffs. We demonstrate that the ties induced by the extensive form do not change the result of Weinstein and...

We define generalized extensive-form games which allow for asymmetric awareness of actions. We extend Pearceʼs (1984) notion of extensive-form (correlated) rationalizability to this setting, explore its properties, and prove existence.