Efficient and Convergent Sequential Pseudo-Likelihood Estimation of Dynamic Discrete Games
Adam Dearing, Jason R. Blevins

TL;DR
This paper introduces a new efficient and convergent sequential pseudo-likelihood estimator for dynamic discrete games, improving computational stability and asymptotic properties, and demonstrating strong finite-sample performance.
Contribution
The paper develops the k-EPL estimator that considers joint behavior of players, reformulates the problem in value function space, and proves its efficiency and convergence properties.
Findings
k-EPL is consistent and asymptotically efficient at each iteration.
The estimator converges almost surely to the maximum likelihood estimator.
Monte Carlo simulations show strong finite-sample performance.
Abstract
We propose a new sequential Efficient Pseudo-Likelihood (k-EPL) estimator for dynamic discrete choice games of incomplete information. k-EPL considers the joint behavior of multiple players simultaneously, as opposed to individual responses to other agents' equilibrium play. This, in addition to reframing the problem from conditional choice probability (CCP) space to value function space, yields a computationally tractable, stable, and efficient estimator. We show that each iteration in the k-EPL sequence is consistent and asymptotically efficient, so the first-order asymptotic properties do not vary across iterations. Furthermore, we show the sequence achieves higher-order equivalence to the finite-sample maximum likelihood estimator with iteration and that the sequence of estimators converges almost surely to the maximum likelihood estimator at a nearly-superlinear rate when the data…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
