Technical Note—Assortment Planning for Two-Sided Sequential Matching Markets

References

• Arnosti N, Johari R, Kanoria Y (2014) Managing congestion in decentralized matching markets. Proc. 15th ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 451.Google Scholar
• Ashlagi I, Shi P (2015) Optimal allocation without money: An engineering approach. Management Sci. 62(4):1078–1097.Link, Google Scholar
• Ashlagi I, Braverman M, Hassidim A (2014) Stability in large matching markets with complementarities. Oper. Res. 62(4):713–732.Link, Google Scholar
• Bront JJM, Méndez-Díaz I, Vulcano G (2009) A column generation algorithm for choice-based network revenue management. Oper. Res. 57(3):769–784.Link, Google Scholar
• Chen N, Immorlica N, Karlin AR, Mahdian M, Rudra A (2009) Approximating matches made in heaven. Albers S, Marchetti-Spaccamela A, Matias Y, Nikoletseas S, Thomas W, eds. Internat. Colloquium Automata Languages Programming ICALP 2009, Lecture Notes in Computer Science, vol. 5555 (Springer, Berlin), 266–278.Google Scholar
• Davis J, Gallego G, Topaloglu H (2013) Assortment planning under the multinomial logit model with totally unimodular constraint structures. Working paper, Cornell University, Ithaca, NY.Google Scholar
• Feldman J, Mehta A, Mirrokni V, Muthukrishnan S (2009) Online stochastic matching: Beating 1-1/e. 2009 50th Annu. IEEE Sympos. Foundations Comput. Sci. (IEEE, Piscataway, NJ), 117–126.Google Scholar
• Garey MR, Johnson DS (2002) Computers and Intractability (W. H. Freeman, New York).Google Scholar
• Gaur V, Honhon D (2006) Assortment planning and inventory decisions under a locational choice model. Management Sci. 52(10):1528–1543.Link, Google Scholar
• Haeupler B, Mirrokni VS, Zadimoghaddam M (2011) Online stochastic weighted matching: Improved approximation algorithms. Chen N, Elkind E, Koutsoupias E, eds. Internat. Workshop Internet Network Econom. WINE 2011, Lecture Notes in Computer Science, vol. 7090 (Springer, Berlin), 170–181.Google Scholar
• Halaburda H, Piskorski MJ, Yıldırım P (2017) Competing by restricting choice: The case of matching platforms. Management Sci. 64(8):3574–3594.Link, Google Scholar
• Immorlica N, Mahdian M (2005) Marriage, honesty, and stability. SODA ‘05 Proc. 16th Annu. ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 53–62.Google Scholar
• Immorlica N, Lucier B, Mao J, Syrgkanis V, Tzamos C (2018) Combinatorial assortment optimization. Christodoulou G, Harks T, eds. WINE 2018 Internat. Conf. Web Internet Econom., Lecture Notes in Computer Science, vol. 11316 (Springer, Cham, Switzerland), 218–231.Google Scholar
• Kanoria Y, Saban D (2021) Facilitating the search for partners on matching platforms. Management Sci. 67(10):5990–6029.Link, Google Scholar
• Kojima F, Pathak PA (2009) Incentives and stability in large two-sided matching markets. Amer. Econom. Rev. 99(3):608–627.Crossref, Google Scholar
• Kök AG, Fisher ML, Vaidyanathan R (2008) Assortment planning: Review of literature and industry practice. Agrawal N, Smith S, eds. Retail Supply Chain Management, International Series in Operations Research & Management Science, vol. 223 (Springer, Boston), 99–153.Google Scholar
• Liu LT, Mania H, Jordan MI (2019) Competing bandits in matching markets. Preprint, submitted June 12, https://arxiv.org/abs/1906.05363.Google Scholar
• Manshadi VH, Gharan SO, Saberi A (2012) Online stochastic matching: Online actions based on offline statistics. Math. Oper. Res. 37(4):559–573.Link, 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:246–263.Crossref, Google Scholar
• Pomatto L, Strack P, Tamuz O (2018) Stochastic dominance under independent noise. Preprint, submitted July 18, https://arxiv.org/abs/1807.06927.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
• Shi P (2016) Assortment planning in school choice [preliminary draft]: Fischer vs. University of Texas. Working paper, Marshall Business School, University of Southern California, Los Angeles.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
• van Ryzin G, Mahajan S (1999) On the relationship between inventory costs and variety benefits in retail assortments. Management Sci., 45(11):1496–1509.Link, Google Scholar