Download Free A Note On Semiparametric Estimation Of Finite Mixtures Of Discrete Choice Models With Application To Game Theoretic Models Book in PDF and EPUB Free Download. You can read online A Note On Semiparametric Estimation Of Finite Mixtures Of Discrete Choice Models With Application To Game Theoretic Models and write the review.

We view a game abstractly as a semiparametric mixture distribution and study the semiparametric efficiency bound of this model. Our results suggest that a key issue for inference is the number of equilibria compared to the number of outcomes. If the number of equilibria is sufficiently large compared to the number of outcomes, root-n consistent estimation of the model will not be possible. We also provide a simple estimator in the case when the efficiency bound is strictly above zero.
This volume focuses on recent developments in the use of structural econometric models in empirical economics. The first part looks at recent developments in the estimation of dynamic discrete choice models. The second part looks at recent advances in the area empirical matching models.
Handbook of Industrial Organization, Volume Four highlights new advances in the field, with this new volume presenting interesting chapters written by an international board of expert authors. Presents authoritative surveys and reviews of advances in theory and econometrics Reviews recent research on capital raising methods and institutions Includes discussions on developing countries
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.
In dynamic discrete choice analysis, controlling for unobserved heterogeneity is an im- portant issue, and finite mixture models provide flexible ways to account for unobserved heterogeneity. This paper studies nonparametric identifiability of type probabilities and type-specific component distributions in finite mixture models of dynamic discrete choices. We derive sufficient conditions for nonparametric identification for various finite mixture models of dynamic discrete choices used in applied work. Three elements emerge as the important determinants of identification; the time-dimension of panel data, the number of values the covariates can take, and the heterogeneity of the response of different types to changes in the covariates. For example, in a simple case, a time-dimension of T = 3 is sufficient for identification, provided that the number of values the covariates can take is no smaller than the number of types, and that the changes in the covariates induce sufficiently heterogeneous variations in the choice probabilities across types. Type-specific components are identifiable even when state dependence is present as long as the panel has a moderate time-dimension ( T {u2265} 6). We also develop a series logit estimator for finite mixture models of dynamic discrete choices and derive its convergence rate.
This book describes the new generation of discrete choice methods, focusing on the many advances that are made possible by simulation. Researchers use these statistical methods to examine the choices that consumers, households, firms, and other agents make. Each of the major models is covered: logit, generalized extreme value, or GEV (including nested and cross-nested logits), probit, and mixed logit, plus a variety of specifications that build on these basics. Simulation-assisted estimation procedures are investigated and compared, including maximum stimulated likelihood, method of simulated moments, and method of simulated scores. Procedures for drawing from densities are described, including variance reduction techniques such as anithetics and Halton draws. Recent advances in Bayesian procedures are explored, including the use of the Metropolis-Hastings algorithm and its variant Gibbs sampling. The second edition adds chapters on endogeneity and expectation-maximization (EM) algorithms. No other book incorporates all these fields, which have arisen in the past 25 years. The procedures are applicable in many fields, including energy, transportation, environmental studies, health, labor, and marketing.
Originally published in 1981. Discrete-choice modelling is an area of econometrics where significant advances have been made at the research level. This book presents an overview of these advances, explaining the theory underlying the model, and explores its various applications. It shows how operational choice models can be used, and how they are particularly useful for a better understanding of consumer demand theory. It discusses particular problems connected with the model and its use, and reports on the authors’ own empirical research. This is a comprehensive survey of research developments in discrete choice modelling and its applications.
We show how to construct bounds on counterfactual choice probabilities in semiparametric discrete-choice models. Our procedure is based on cyclic monotonicity, a convex-analytic property of the random utility discrete-choice model. These bounds are useful for typical counterfactual exercises in aggregate discrete-choice demand models. In our semiparametric approach, we do not specify the parametric distribution for the utility shocks, thus accommodating a wide variety of substitution patterns among alternatives. Computation of the counterfactual bounds is a tractable linear programming problem. We illustrate our approach in a series of Monte Carlo simulations and an empirical application using scanner data.