Estimating Dynamic Discrete-Choice Games of Incomplete Information
33 Pages Posted: 6 Oct 2012 Last revised: 29 Aug 2014
Date Written: August 22, 2014
Abstract
We investigate the estimation of models of dynamic discrete-choice games of incomplete information, formulating the maximum-likelihood estimation exercise as a constrained optimization problem which can be solved using state-of-the-art constrained optimization solvers. Under the assumption that only one equilibrium is played in the data, our approach avoids repeatedly solving the dynamic game or finding all equilibria for each candidate vector of the structural parameters. We conduct Monte Carlo experiments to investigate the numerical performance and finite-sample properties of the constrained optimization approach for computing the maximum-likelihood estimator, the two-step pseudo maximum-likelihood estimator and the nested pseudo-likelihood estimator, implemented by both the nested pseudo-likelihood algorithm and a modified nested pseudo-likelihood algorithm.
Keywords: dynamic discrete-choice games of incomplete information, maximum-likelihood estimator, constrained optimization, nested pseudo-likelihood estimator
JEL Classification: C13, C61
Suggested Citation: Suggested Citation
Do you have a job opening that you would like to promote on SSRN?
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