»ã±¨±êÌâ (Title)£ºÊý¾ÝÇý¶¯µÄÑ¡Æ·ÓÅ»¯Ä£ÐÍ £¨A data-driven approach to modeling assortment optimization: The tractable case of similar substitutes £©

»ã±¨ÈË (Speaker)£º ½­²¨ ½ÌÊÚ£¨ÉϺ£²Æ¾­´óѧÐÅÏ¢ÖÎÀíÓ빤³ÌѧԺ£©

»ã±¨¹¦·ò (Time)£º2023Äê10 ÔÂ9ÈÕ ( ÖÜÒ» ) 15£º30-17£º30

»ã±¨µØÖ· (Place)£ºÐ£±¾²¿ F309ÊÒ

Ô¼ÇëÈË(Inviter)£º°×ÑÓÇÙ ½ÌÊÚ

Ö÷°ì²¿ÃÅ£ºÀíѧԺÊýѧϵ

»ã±¨ÌáÒª£º

Abstract: We propose a data-driven approach to model assortment optimization problems based on three real data sets. Our work is motivated by two empirical observations from customers browsing history on Taobao: one is that most customers browse very few items (¡Ü 5) before they make a purchase; the second is that there exists a sorting of items so that customer consideration sets are a small interval in the sorting. This algorithm sorting can be discovered by an algorithm due to Cuthill and McKee (1969). Based on these empirical observations, we build a framework for choice models, and show the connection between our framework and some popular choice models. To verify that models under our framework capture reality well, we use the dataset from Bodea et al. (2009) to fit different models and compare their performance on out-of-sample data. The result shows that our model provides a good balance between prediction accuracy and model complexity. Then, we consider the assortment optimization and pricing problem under our model and give fixed-parameter tractable algorithms for both problems. Finally, we implement our approach¡ªgoing from data to modeling, and finally to optimization¡ªon a third data set of customer clicking history on JD.com.