Technical Note—Active Learning for Nonparametric Choice Models

References

• Aggarwal CC, Kong X, Gu Q, Han J, Yu PS (2014) Active Learning: A Survey (CRC Press, Boca Raton, FL).Google Scholar
• Agrawal S, Avadhanula V, Goyal V, Zeevi A (2019) MNL-bandit: A dynamic learning approach to assortment selection. Oper. Res. 67(5):1453–1485.Link, Google Scholar
• Angluin D (1988) Queries and concept learning. Machine Learn. 2:319–342.Crossref, Google Scholar
• Aouad A, Levi R, Segev D (2019) Approximation algorithms for dynamic assortment optimization models. Math. Oper. Res. 44(2):487–511.Link, Google Scholar
• Aouad A, Farias V, Levi R, Segev D (2018) The approximability of assortment optimization under ranking preferences. Oper. Res. 66(6):1661–1669.Link, Google Scholar
• Caine GJ, Plaut RH (1976) Optimal inventory policy when stockouts alter demand. Naval Res. Logist. Quart. 23(1):1–13.Crossref, Google Scholar
• Chen Q, Golrezaei N, Susan F (2022) Fair assortment planning. Preprint, submitted August 15, https://arxiv.org/abs/220807341.Google Scholar
• Chen Q, Liang JCN, Golrezaei N, Bouneffouf D (2024) Interpolating item and user fairness in recommendation systems. Adv. Neural Inform. Processing Systems, vol. 37 (Curran Associates, Inc., Red Hook, NY), 50189–50229.Google Scholar
• Chen X, Shi C, Wang Y, Zhou Y (2021) Dynamic assortment planning under nested logit models. Production Oper. Management 30(1):85–102.Crossref, Google Scholar
• Chernev A (2006) Decision focus and consumer choice among assortments. J. Consumer Res. 33(1):50–59.Crossref, Google Scholar
• Cohn DA, Ghahramani Z, Jordan MI (1996) Active learning with statistical models. J. Artificial Intelligence Res. 4:129–145.Crossref, Google Scholar
• Derakhshan M, Golrezaei N, Manshadi V, Mirrokni V (2022) Product ranking on online platforms. Management Sci. 68(6):4024–4041.Google Scholar
• Farias VF, Jagabathula S, Shah D (2013) A nonparametric approach to modeling choice with limited data. Management Sci. 59(2):305–322.Link, Google Scholar
• Feige U (1998) A threshold of ln n for approximating set cover. J. ACM 45(4):634–652.Crossref, Google Scholar
• Feldman J, Paul A, Topaloglu H (2019) Assortment optimization with small consideration sets. Oper. Res. 67(5):1283–1299.Link, Google Scholar
• Fitzsimons GJ (2000) Consumer response to stockouts. J. Consumer Res. 27(2):249–266.Crossref, Google Scholar
• Gallego G, Lu W (2021) An optimal greedy heuristic with minimal learning regret for the Markov chain choice model. Preprint, submitted March 23, https://doi.org/10.2139/ssrn.3810470.Google Scholar
• Goldin J, Reck D (2020) Revealed-preference analysis with framing effects. J. Political Econom. 128(7):2759–2795.Google Scholar
• Golrezaei N, Manshadi V, Schneider J, Sekar S (2022) Learning product rankings robust to fake users. Oper. Res. 71(4):1171–1196.Google Scholar
• Haensel A, Koole G (2011) Estimating unconstrained demand rate functions using customer choice sets. J. Revenue Pricing Management 10(5):438–454.Crossref, Google Scholar
• Hoeffding W (1963) Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 58(301):13–30.Crossref, Google Scholar
• Honhon D, Jonnalagedda S, Pan XA (2012) Optimal algorithms for assortment selection under ranking-based consumer choice models. Manufacturing Service Oper. Management 14(2):279–289.Link, Google Scholar
• Jagabathula S, Rusmevichientong P (2017) A nonparametric joint assortment and price choice model. Management Sci. 63(9):3128–3145.Link, Google Scholar
• Jagabathula S, Rusmevichientong P (2019) The limit of rationality in choice modeling: Formulation, computation, and implications. Management Sci. 65(5):2196–2215.Abstract, Google Scholar
• Jagabathula S, Vulcano G (2018) A partial-order-based model to estimate individual preferences using panel data. Management Sci. 64(4):1609–1628.Link, Google Scholar
• Jagabathula S, Mitrofanov D, Vulcano G (2022) Personalized retail promotions through a directed acyclic graph–based representation of customer preferences. Oper. Res. 70(2):641–665.Link, Google Scholar
• Kamishima T (2003) Nantonac collaborative filtering: Recommendation based on order responses. Proc. 9th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (Association for Computing Machinery, New York), 583–588.Google Scholar
• Kamishima T, Kazawa H, Akaho S (2005) Supervised ordering-an empirical survey. Proc. 5th IEEE Internat. Conf. Data Mining (IEEE, Piscataway, NJ).Google Scholar
• Kim M, Lennon SJ (2011) Consumer response to online apparel stockouts. Psych. Marketing 28(2):115–144.Crossref, Google Scholar
• Kleinberg J, Tardos E (2006) Algorithm Design (Pearson Education India).Google Scholar
• Littlestone N (1988) Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learn. 2:285–318.Crossref, Google Scholar
• Lu W, Sahin O, Wang R (2023) A simple way towards fair assortment planning: Algorithms and welfare implications. Preprint, submitted January 20, https://dx.doi.org/10.2139/ssrn.4514495.Google Scholar
• Ma W (2023) When is assortment optimization optimal? Management Sci. 69(4):2088–2105.Link, Google Scholar
• Niazadeh R, Golrezaei N, Wang J, Susan F, Badanidiyuru A (2020) Online learning via offline greedy: Applications in market design and optimization. Preprint, submitted June 25, https://doi.org/10.2139/ssrn.3613756.Google Scholar
• Perakis G, Singhvi D (2024) Dynamic pricing with unknown non-parametric demand and limited price changes. Oper. Res. 72(6):2726–2744. Google Scholar
• Rusmevichientong P, Shen Z-JM, Shmoys DB (2010) Dynamic assortment optimization with a multinomial logit choice model and capacity constraint. Oper. Res. 58(6):1666–1680.Link, Google Scholar
• Sauré D, Zeevi A (2013) Optimal dynamic assortment planning with demand learning. Manufacturing Service Oper. Management 15(3):387–404.Link, Google Scholar
• Settles B (2009) Active learning literature survey. Technical report, Department of Computer Sciences, University of Wisconsin, Madison.Google Scholar
• Ulu C, Honhon D, Alptekinoğlu A (2012) Learning consumer tastes through dynamic assortments. Oper. Res. 60(4):833–849.Link, Google Scholar
• van Ryzin G, Vulcano G (2015) A market discovery algorithm to estimate a general class of nonparametric choice models. Management Sci. 61(2):281–300.Link, Google Scholar
• van Ryzin G, Vulcano G (2017) An expectation-maximization method to estimate a rank-based choice model of demand. Oper. Res. 65(2):396–407.Link, Google Scholar
• Zheng Z, Padmanabhan B (2006) Selectively acquiring customer information: A new data acquisition problem and an active learning-based solution. Management Sci. 52(5):697–712.Link, Google Scholar