Identification in Some Discrete Choice Models

Identification in Some Discrete Choice Models

Author: Eric Mbakop

Publisher:

Published: 2022

Total Pages: 0

ISBN-13:

DOWNLOAD EBOOK

This paper develops a new computational method that generates all the conditional moment inequalities that characterize the identified set of the parametric components of several semi- parametric panel data models of discrete choice. I consider very flexible models that only impose weak distributional restrictions on the joint distribution of the covariates, fixed effects and shocks. By exploiting the discreteness and convexity of the problem, I show that the identified set of the parametric component of the model can be characterized from the extreme points of a polytope which I describe explicitly. A direct implication of this observation is that finding all the inequalities that characterize the sharp identified set can be viewed as a purely computational problem, and any algorithm that can retrieve all the extreme points of our polytopes recovers all the inequality restrictions that characterize the identified set. The determination of all the extreme points of a polytope is a computational difficult task, and I exploit the particular structure the polytopes that occur in discrete choice models to propose an algorithm that works well for problems of moderate size. The algorithm is used to re-derive many known results: The algorithm can, for instance, recover all the conditional moment inequalities that were found in Manski 1987, Pakes and Porter 2021 and Khan, Ponomareva, and Tamer 2021. I also use the algorithm to generate some new conditional moment inequalities under alternative distributional assumptions, as well to generate new inequalities in some cases that were left open in Pakes and Porter 2021 and Khan, Ponomareva, and Tamer 2021.


Essays on Discrete Choice Models

Essays on Discrete Choice Models

Author: Wei Song

Publisher:

Published: 2017

Total Pages: 162

ISBN-13:

DOWNLOAD EBOOK

This dissertation focuses on the identification and estimation of discrete choice models. In practice, if the error term is independent of the covariates and follows some known distribu- tion, the discrete choice model is usually estimated using some parametric estimator, such as Probit and Logit. However, when the distribution of the error is unknown, misspecification would in general cause the estimators inconsistent even if the independence between the covariates and the error still holds. The two chapters relax the assumptions on the error distribution in the discrete choice models and propose semiparametric estimators.


Identification and Efficient Semiparametric Estimation of a Dynamic Discrete Game

Identification and Efficient Semiparametric Estimation of a Dynamic Discrete Game

Author: Patrick L. Bajari

Publisher:

Published: 2015

Total Pages: 0

ISBN-13:

DOWNLOAD EBOOK

In this paper, we study the identification and estimation of a dynamic discrete game allowing for discrete or continuous state variables. We first provide a general nonparametric identification result under the imposition of an exclusion restriction on agent payoffs. Next we analyze large sample statistical properties of nonparametric and semiparametric estimators for the econometric dynamic game model. We also show how to achieve semiparametric efficiency of dynamic discrete choice models using a sieve based conditional moment framework. Numerical simulations are used to demonstrate the finite sample properties of the dynamic game estimators. An empirical application to the dynamic demand of the potato chip market shows that this technique can provide a useful tool to distinguish long term demand from short term demand by heterogeneous consumers.