Identification and Estimation of Discrete Games of Complete Information
54 Pages Posted: 11 Oct 2004 Last revised: 30 Apr 2023
Date Written: October 2004
Abstract
We discuss the identification and estimation of discrete games of complete information. Following Bresnahan and Reiss (1990, 1991), a discrete game is a generalization of a standard discrete choice model where utility depends on the actions of other players. Using recent algorithms to compute all of the Nash equilibria to a game, we propose simulation-based estimators for static, discrete games. With appropriate exclusion restrictions about how covariates enter into payoffs and influence equilibrium selection, the model is identified with only weak parametric assumptions. Monte Carlo evidence demonstrates that the estimator can perform well in moderately-sized samples. As an application, we study the strategic decision of firms in spatially-separated markets to establish a presence on the Internet.
Suggested Citation: Suggested Citation
Do you have negative results from your research you’d like to share?
Recommended Papers
-
Estimating Dynamic Models of Imperfect Competition
By Patrick Bajari, C. Lanier Benkard, ...
-
Estimating Dynamic Models of Imperfect Competition
By Patrick Bajari, C. Lanier Benkard, ...
-
Sequential Estimation of Dynamic Discrete Games
By Victor Aguirregabiria and Pedro Mira
-
By Ariel Pakes and Paul Mcguire
-
Simple Estimators for the Parameters of Discrete Dynamic Games (with Entry/Exit Examples)
By Ariel Pakes, Michael Ostrovsky, ...
-
Simple Estimators for the Parameters of Discrete Dynamic Games (with Entry/Exit Samples)
By Ariel Pakes, Michael Ostrovsky, ...
-
A Dynamic Analysis of the Market for Wide-Bodied Commercial Aircraft
-
Multiple Equilibria and Deterrence in Airline Markets
By Federico Ciliberto and Zhou Zhang
-
Computable Markov-Perfect Industry Dynamics: Existence, Purification, and Multiplicity
-
Computable Markov-Perfect Industry Dynamics: Existence, Purification, and Multiplicity