A gradient descent method for estimating the Markov chain choice model
From MaRDI portal
Recommendations
Cites work
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- A Markov chain approximation to choice modeling
- Assortment optimization under variants of the nested logit model
- Convex programming in Hilbert space
- Dynamic assortment optimization with a multinomial logit choice model and capacity constraint
- Estimating primary demand for substitutable products from sales transaction data
- Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes
- On the Goldstein-Levitin-Polyak gradient projection method
- Projected gradient methods for linearly constrained problems
- Revenue management under the Markov chain choice model
- Technical note: An expectation-maximization algorithm to estimate the parameters of the Markov chain choice model
- Technical note: An expectation-maximization method to estimate a rank-based choice model of demand
Cited in
(1)
This page was built for publication: A gradient descent method for estimating the Markov chain choice model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6097386)