Solving finite mixture models: Efficient computation in economics under serial and parallel execution
From MaRDI portal
Publication:1020507
DOI10.1007/s10614-005-6413-3zbMath1161.91367OpenAlexW2112115577MaRDI QIDQ1020507
Publication date: 29 May 2009
Published in: Computational Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10614-005-6413-3
Numerical mathematical programming methods (65K05) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items
The importance of moral reflection and self-reported data in a dictator game with production ⋮ A parallel implementation of the simplex function minimization routine ⋮ Multi-core CPUs, clusters, and grid computing: A tutorial ⋮ Dynamic discrete choice structural models: a survey
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximum likelihood estimation using parallel computing: An introduction to MPI
- A note on inherent replication properties of local cellular automata transition functions
- Conditional Choice Probabilities and the Estimation of Dynamic Models
- A Method for Minimizing the Impact of Distributional Assumptions in Econometric Models for Duration Data
- Estimating a Market Equilibrium Search Model from Panel Data on Individuals
- Computationally intensive econometrics using a distributed matrix-programming language
- Finite Mixture Distributions, Sequential Likelihood and the EM Algorithm
- Swapping the Nested Fixed Point Algorithm: A Class of Estimators for Discrete Markov Decision Models
- Maximization by Quadratic Hill-Climbing
- A Social Equilibrium Existence Theorem*