Parameter identification in Markov chain choice models

被引:6
作者
Gupta, Arushi [1 ]
Hsu, Daniel [2 ]
机构
[1] Princeton Univ, Princeton, NJ 08544 USA
[2] Columbia Univ, New York, NY USA
基金
美国国家科学基金会;
关键词
Discrete choice models; Markov chain choice models; Parameter identification;
D O I
10.1016/j.tcs.2019.11.014
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This work studies the parameter identification problem for the Markov chain choice model of Blanchet, Gallego, and Goyal used in assortment planning. In this model, the product selected by a customer is determined by a Markov chain over the products, where the products in the offered assortment are absorbing states. The underlying parameters of the model were previously shown to be identifiable from the choice probabilities for the all-products assortment, together with choice probabilities for assortments of all-but-one products. Obtaining and estimating choice probabilities for such large assortments is not desirable in many settings. The main result of this work is that the parameters may be identified from assortments of sizes two and three, regardless of the total number of products. The result is obtained via a simple and efficient parameter recovery algorithm. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码:99 / 107
页数:9
相关论文
共 10 条
[1]  
[Anonymous], 2016, CAPACITY CONSTRAINED, DOI DOI 10.2139/SSRN.2626484
[2]  
Bermudez A. J., 1994, SAVMA Symposium 1994 Proceedings., P1
[3]   A Markov Chain Approximation to Choice Modeling [J].
Blanchet, Jose ;
Gallego, Guillermo ;
Goyal, Vineet .
OPERATIONS RESEARCH, 2016, 64 (04) :886-905
[4]  
DEBREU G, 1960, AM ECON REV, V50, P186
[5]   A General Attraction Model and Sales-Based Linear Program for Network Revenue Management Under Customer Choice [J].
Gallego, Guillermo ;
Ratliff, Richard ;
Shebalov, Sergey .
OPERATIONS RESEARCH, 2015, 63 (01) :212-232
[6]  
McFadden D, 2000, J APPL ECONOMET, V15, P447, DOI 10.1002/1099-1255(200009/10)15:5<447::AID-JAE570>3.0.CO
[7]  
2-1
[8]  
PLACKETT RL, 1975, ROY STAT SOC C-APP, V24, P193
[9]  
Rusmevichientong Paat., 2010, Assortment optimization with mixtures of logits
[10]  
Train KE, 2009, DISCRETE CHOICE METHODS WITH SIMULATION, 2ND EDITION, P1, DOI 10.1017/CBO9780511805271