Discrete Choice Methods with Simulation (Hardcover, 2nd Revised edition)

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Release date:	July 2009
First published:	August 2009
Authors:	Kenneth E. Train
Dimensions:	229 x 152 x 25mm (L x W x T)
Format:	Hardcover
Pages:	400
Edition:	2nd Revised edition
ISBN-13:	978-0-521-76655-5
Categories:	Books > Science & Mathematics > Mathematics > Probability & statistics Books > Business & Economics > Economics > Econometrics > General Promotions
LSN:	0-521-76655-9
Barcode:	9780521766555

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!