Economics at your fingertips  

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

Paul S. Koh

Papers from

Abstract: This paper considers the estimation of discrete games of complete information without assumptions on the equilibrium selection rule, which is often viewed as computationally difficult. We propose computationally attractive approaches that avoid simulation and grid search. We show that the moment inequalities proposed by Andrews, Berry, and Jia (2004) can be expressed in terms of multinomial logit probabilities, and the corresponding identified set is convex. When actions are binary, we can characterize the sharp identified set using closed-form inequalities. We also propose a simple approach to inference. Two real-data experiments illustrate that our methodology can be several orders of magnitude faster than the existing approaches.

Date: 2022-05, Revised 2022-06
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: Track citations by RSS feed

Downloads: (external link) 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:

Access Statistics for this paper

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

Page updated 2023-08-12
Handle: RePEc:arx:papers:2205.05002