Estimation, Prediction, and Assortment Optimization for Markov Chain Choice Models with Panel Data
Not on the map. Why?
Abstract (arXiv)
We propose a framework for the Markov chain (MC) choice model with panel data, including parameter estimation, personalized choice prediction, and personalized assortment optimization. In contrast to the traditional setting, which assumes that each transaction is independently drawn from a random utility model, our framework accounts for dependencies among transactions for the same customer in historical data, captured by partial-ordering preference information. To the best of our knowledge, our framework initiates the study of choice modeling with panel data under MC. As our primary result, we propose novel expectation-maximization (EM) algorithms for MC parameter estimation by incorporating partial-ordering-based customer preference information. On synthetic datasets and the sushi dataset, our EM algorithms outperform the traditional EM algorithm of Simsek and Topaloglu (Operations Research, 66, 2018) and multinomial-logit-based partial-order benchmarks adapted from Jagabathula and Vulcano (Management Science, 64, 2018). As our secondary contribution, we present hardness and computational results for conditional choice prediction and assortment optimization problems. These results complement our estimation framework and clarify the computational landscape of conditional choice and assortment optimization, which may be of independent interest.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 1 of its 40 references that are in the map. First posted on arXiv 10 Jul 2026.
Builds on
1 of 40 references.
References · 1
- 2017Parameter identification in Markov chain choice modelscited by 3
Built on by
Not cited yet.