We prove the generic equivalence between quasi-perfect equilibrium and sequential equilibrium. Combining this result with Blume and Zame (1994) shows that perfect, quasi-perfect and sequential equilibrium coincide in generic games

This paper provides a thorough analysis of oligopolistic markets with positive demand-side network externalities and perfect compatibility. The minimal structure imposed on the model primitives is such that industry output increases in a firm's rivals' total output as well as in the expected...

We propose a computationally feasible way of deriving the identified features of models with multiple equilibria in pure or mixed strategies. It is shown that in the case of Shapley regular normal form games, the identified set is characterized by the inclusion of the true data distribution...

Inspired by the social psychology literature, we study the implications of categorical thinking on decision making in the context of a large normal form game. Every agent has a categorization (partition) of her opponents and can only observe the average behavior in each category. A strategy...

We examine contemporaneous perfect E-equilibria, in which a player's actions after every history, evaluated at the point of deviation from the equilibrium, must be within of a best E response. This concept implies, but is stronger than, Radner's ex ante perfect E-equilibrium. A strategy profile...

We derive the existence of a Walras equilibrium directly from Nash's theorem on noncooperative games. No price player is involved, nor are generalized games. Instead we use a variant of the Shapley-Shubik trading-post game

We examine contemporaneous perfect equilibria, in which a player's actions after every history, evaluated at the point of deviation from the equilibrium, must be within of a best response. This concept implies, but is not implied by Radner's ex ante perfect equilibrium. A strategy profile is a...

Probabilistic equilibrium selection is defined by equipping a set of theoretical solutions with an additive weighting function. In the context of dynamic processes, a weighting function can be constructed by assigning to each theoretical solution a weight equal to the relative size of its basin...