Discrete Choice Methods with Simulation

Discrete Choice Methods with Simulation

EnglishHardbackPrint on demand
Train Kenneth E.
Cambridge University Press
EAN: 9780521766555
Print on demand
Delivery on Wednesday, 1. of July 2026
CZK 3,105
Common price CZK 3,450
Discount 10%
pc
Do you want this product today?
Megabooks Praha Korunní
not available
Librairie Francophone Praha Štěpánská
not available
Megabooks Ostrava
not available
Megabooks Olomouc
not available
Megabooks Plzeň
not available
Megabooks Brno
not available
Megabooks Hradec Králové
not available
Megabooks České Budějovice
not available
Megabooks Liberec
not available

Detailed information

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. Recent advances in Bayesian procedures are explored, including the use of the Metropolis-Hastings algorithm and its variant Gibbs sampling. This 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.
EAN 9780521766555
ISBN 0521766559
Binding Hardback
Publisher Cambridge University Press
Publication date July 6, 2009
Pages 400
Language English
Dimensions 229 x 152 x 25
Country United Kingdom
Authors Train Kenneth E.
Illustrations 17 Tables, unspecified; 46 Line drawings, unspecified
Edition 2 Revised edition
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.