Constrained Assortment Optimization Under the Markov Chain–based Choice Model

References

• Alimonti P, Kann V (2000) Some APX-completeness results for cubic graphs. Theoret. Comput. Sci. 237(1):123–134.Crossref, Google Scholar
• Aouad A, Farias VF, Levi R (2015) Assortment optimization under consider-then-choose choice models. Working paper, London Business School, London.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
• Bar-Yehuda R, Even S (1985) A local-ratio theorem for approximating the weighted vertex cover problem. Ausiello G, Lucertini M, eds. North-Holland Mathematics Studies, vol. 109 (North-Holland, Amsterdam), 27–45.Google Scholar
• Bar-Yehuda R, Rawitz D (2006) A tale of two methods. Golumbic MC, Ben-Arroyo Hartman I, eds. Theoretical Computer Science: Essays in Memory of Shimon Even (Springer, Berlin), 196–217.Crossref, Google Scholar
• Bar-Yehuda R, Bendel K, Freund A, Rawitz D (2005) The local ratio technique and its application to scheduling and resource allocation problems. Golumbic MC, Ben-Arroyo Hartman I, eds. Graph Theory, Combinatorics and Algorithms (Springer, Boston), 107–143.Crossref, Google Scholar
• Blanchet JH, Gallego G, Goyal V (2016) A Markov chain approximation to choice modeling. Oper. Res. 64(4):886–905.Link, Google Scholar
• Buchbinder N, Feldman M, Naor JS, Schwartz R (2014) Submodular maximization with cardinality constraints. Proc. 25th Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Portland, OR), 1433–1452.Crossref, Google Scholar
• Calinescu G, Chekuri C, Pál M, Vondrák J (2011) Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput. 40(6):1740–1766.Crossref, Google Scholar
• Chow YS, Robbins H, Siegmund D (1971) Great Expectations: The Theory of Optimal Stopping (Houghton Mifflin, Boston).Google Scholar
• Davis J, Gallego G, Topaloglu H (2013) Assortment planning under the multinomial logit model with totally unimodular constraint structures. Technical Report, Cornell University, Ithaca, NY.Google Scholar
• Davis JM, Gallego G, Topaloglu H (2014) Assortment optimization under variants of the nested logit model. Oper. Res. 62(2):250–273.Link, Google Scholar
• Désir A, Goyal V, Zhang J (2014) Near-optimal algorithms for capacity constrained assortment optimization. Working paper, Technology and Operations Management, INSEAD, Fontainebleau, France.Google Scholar
• Désir A, Goyal V, Jagabathula S, Segev D (2016) Assortment optimization under the Mallows model. Lee DD, Sugiyama M, Luxburg UV, Guyon I, Garnett R, eds. Advances in Neural Information Processing Systems, vol. 29 (Curran Associates, Red Hook, NY), 4700–4708.Google Scholar
• Farias VF, Jagabathula S, Shah D (2011) Assortment optimization under general choice. Working paper, Massachusetts Institute of Technology, Cambridge.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
• Feldman J, Topaloglu H (2017a) Technical note–Capacitated assortment optimization under the multinomial logit model with nested consideration sets. Oper. Res. 66(2):380–391.Link, Google Scholar
• Feldman JB, Topaloglu H (2015) Capacity constraints across nests in assortment optimization under the nested logit model. Oper. Res. 63(4):812–822.Link, Google Scholar
• Feldman JB, Topaloglu H (2017b) Revenue management under the Markov chain choice model. Oper. Res. 65(5):1322–1342.Link, Google Scholar
• Gallego G, Topaloglu H (2014) Constrained assortment optimization for the nested logit model. Management Sci. 60(10):2583–2601.Link, Google Scholar
• Gallego G, Iyengar G, Phillips R, Dubey A (2004) Managing flexible products on a network. CORC Technical Report TR-2004-01, Columbia University, New York.Google Scholar
• Gallego G, Ratliff R, Shebalov S (2015) A general attraction model and sales-based linear program for network revenue management under customer choice. Oper. Res. 63(1):212–232.Link, Google Scholar
• Gallego G, Li A, Truong V-A, Wang X (2016) Online personalized resource allocation with customer choice. Working paper, Hong Kong University of Science and Technology, Hong Kong.Google Scholar
• Golrezaei N, Nazerzadeh H, Rusmevichientong P (2014) Real-time optimization of personalized assortments. Management Sci. 60(6):1532–1551.Link, Google Scholar
• Kök AG, Fisher ML (2007) Demand estimation and assortment optimization under substitution: Methodology and application. Oper. Res. 55(6):1001–1021.Link, Google Scholar
• Kulik A, Shachnai H, Tamir T (2013) Approximations for monotone and nonmonotone submodular maximization with knapsack constraints. Math. Oper. Res. 38(4):729–739.Link, Google Scholar
• Lee J, Sviridenko M, Vondrák J (2010) Submodular maximization over multiple matroids via generalized exchange properties. Math. Oper. Res. 35(4):795–806.Link, Google Scholar
• Luce RD (1959) Individual Choice Behavior: A Theoretical Analysis (Wiley, New York).Google Scholar
• McFadden D (1973) Conditional logit analysis of qualitative choice behavior. Zarembka P, ed. Frontiers in Econometrics (Academic Press, New York), 105–142.Google Scholar
• McFadden D (1978) Modelling the choice of residential location. Transportation Res. Rec. 673:72–77.Google Scholar
• McFadden D, Train K (2000) Mixed MNL models for discrete response. J. Appl. Econometrics 15(5):447–470.Crossref, Google Scholar
• Méndez-Díaz I, Miranda-Bront JJ, Vulcano G, Zabala P (2014) A branch-and-cut algorithm for the latent-class logit assortment problem. Discrete Appl. Math. 164(Part 1):246–263.Crossref, Google Scholar
• Nemhauser GL, Wolsey LA (1978) Best algorithms for approximating the maximum of a submodular set function. Math. Oper. Res. 3(3):177–188.Link, Google Scholar
• Nip K, Wang Z, Wang Z (2017) Assortment optimization under a single transition model. Working paper, Tsinghua University, Beijing.Google Scholar
• Paul A, Davis JM, Feldman J (2017) Assortment optimization and pricing under a nonparametric tree choice model. Manufacturing Service Oper. Management 20(3):550–565.Link, Google Scholar
• Plackett RL (1975) The analysis of permutations. J. Roy. Statist. Soc. Series C Appl. Statist. 24(2):193–202.Crossref, Google Scholar
• Ragain S, Ugander J (2016) Pairwise choice Markov chains. Lee DD, Sugiyama M, Luxburg UV, Guyon I, Garnett R, eds. Advances in Neural Information Processing Systems, vol. 29 (Curran Associates, Red Hook, NY), 3198–3206.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
• Rusmevichientong P, Shmoys D, Tong C, Topaloglu H (2014) Assortment optimization under the multinomial logit model with random choice parameters. Production Oper. Management 23(11):2023–2039.Crossref, Google Scholar
• Schrijver A (1986) Theory of Linear and Integer Programming (John Wiley & Sons, Chichester, UK).Google Scholar
• Simsek AS, Topaloglu H (2017) Technical note — An expectation-maximization algorithm to estimate the parameters of the Markov chain choice model. Oper. Res. 66(3):748–760.Link, Google Scholar
• Talluri K, van Ryzin G (2004) Revenue management under a general discrete choice model of consumer behavior. Management Sci. 50(1):15–33.Link, Google Scholar
• Thurstone LL (1927) A law of comparative judgment. Psych. Rev. 34(4):273–286.Crossref, Google Scholar
• Train KE (2009) Discrete Choice Methods with Simulation (Cambridge University Press, New York).Crossref, Google Scholar
• Williams HW (1977) On the formation of travel demand models and economic evaluation measures of user benefit. Environ. Planning A 9(3):285–344.Crossref, Google Scholar
• Zhang D, Cooper WL (2005) Revenue management for parallel flights with customer-choice behavior. Oper. Res. 53(3):415–431.Link, Google Scholar