Estimating Discrete Games of Complete Information: Bringing Logit Back in the Game

Paul S. Koh

Papers from arXiv.org

Abstract: Estimating discrete games of complete information is often computationally difficult due to partial identification and the absence of closed-form moment characterizations. This paper proposes computationally tractable approaches to estimation and inference that remove the computational burden associated with equilibria enumeration, numerical simulation, and grid search. Separately for unordered and ordered-actions games, I construct an identified set characterized by a finite set of generalized likelihood-based conditional moment inequalities that are convex in (a subvector of) structural model parameters under the standard logit assumption on unobservables. I use simulation and empirical examples to show that the proposed approaches generate informative identified sets and can be several orders of magnitude faster than existing estimation methods.

Date: 2022-05, Revised 2024-08
New Economics Papers: this item is included in nep-dcm, nep-ecm and nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://arxiv.org/pdf/2205.05002 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2205.05002

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().