A player's pure strategy is called relevant for an outcome of a game in extensive form with perfect recall if there exists a weakly sequential equilibrium with that outcome for which the strategy is an optimal reply at every information set it does not exclude. The outcome satisfies forward induction if it results from a weakly sequential equilibrium in which players' beliefs assign positive probability only to relevant strategies at each information set reached by a profile of relevant strategies. We prove that if there are two players and payoffs are generic, then an outcome satisfies forward induction if every game with the same reduced normal form after eliminating redundant pure strategies has a sequential equilibrium with an equivalen...
We provide an epistemic analysis of forward induction in games with complete and incomplete informat...
We analyze which normal form solution concepts capture the notion of forward induction, as defined b...
Pearce’s (Econometrica 52:1029-1050, 1984) extensive-form rationalizablity (EFR) is a solution conce...
A player's pure strategy is called relevant for an outcome of a game in extensive form with perfect ...
Abstract. Forward induction is the notion that players in a game assume, even when con-fronted with ...
Forward induction is the notion that players in a game assume, even when confronted with an unexpect...
Abstract: "In this paper we isolate a particular refinement of the notion of Nash equilibrium that i...
All equilibrium concepts implicitly make a correct beliefs assumption, stating that a player believe...
The author proposes a refinement of seq uential equilibrium for extensive form games by generalizing...
Abstract. We generalize the well-known backward induction procedure to the case of extensive games w...
Abstract: "In this paper we isolate a particular refinement of the notion of Nash equilibrium that i...
Battigalli (1997) has shown that in dynamic games with perfect information and without relevant ties...
We say that a player is certain of an event A if he gives A probability 1. There is common certainty...
This paper studies the case where a game is played in a particular context. The context in-uences wh...
Backward Induction is a fundamental concept in game theory. As an algorithm, it can only be used to ...
We provide an epistemic analysis of forward induction in games with complete and incomplete informat...
We analyze which normal form solution concepts capture the notion of forward induction, as defined b...
Pearce’s (Econometrica 52:1029-1050, 1984) extensive-form rationalizablity (EFR) is a solution conce...
A player's pure strategy is called relevant for an outcome of a game in extensive form with perfect ...
Abstract. Forward induction is the notion that players in a game assume, even when con-fronted with ...
Forward induction is the notion that players in a game assume, even when confronted with an unexpect...
Abstract: "In this paper we isolate a particular refinement of the notion of Nash equilibrium that i...
All equilibrium concepts implicitly make a correct beliefs assumption, stating that a player believe...
The author proposes a refinement of seq uential equilibrium for extensive form games by generalizing...
Abstract. We generalize the well-known backward induction procedure to the case of extensive games w...
Abstract: "In this paper we isolate a particular refinement of the notion of Nash equilibrium that i...
Battigalli (1997) has shown that in dynamic games with perfect information and without relevant ties...
We say that a player is certain of an event A if he gives A probability 1. There is common certainty...
This paper studies the case where a game is played in a particular context. The context in-uences wh...
Backward Induction is a fundamental concept in game theory. As an algorithm, it can only be used to ...
We provide an epistemic analysis of forward induction in games with complete and incomplete informat...
We analyze which normal form solution concepts capture the notion of forward induction, as defined b...
Pearce’s (Econometrica 52:1029-1050, 1984) extensive-form rationalizablity (EFR) is a solution conce...