Online Assortment Optimization for Two-Sided Matching Platforms

References

• Afeche P, Caldentey R, Gupta V (2022) On the optimal design of a bipartite matching queueing system. Oper. Res. 70(1):363–401.Google Scholar
• Akbarpour M, Li S, Gharan SO (2020) Thickness and information in dynamic matching markets. J. Political Econom. 128(3):785–815.Crossref, Google Scholar
• Anderson R, Ashlagi I, Gamarnik D, Kanoria Y (2017) Efficient dynamic barter exchange. Oper. Res. 65(6):1446–1459.Link, Google Scholar
• Aouad A, Saritaç Ö (2022) Dynamic stochastic matching under limited time. Oper. Res. 70(4):2349–2383.Google Scholar
• Aouad A, Segev D (2021) Display optimization for vertically differentiated locations under multinomial logit preferences. Management Sci. 67(6):3519–3550.Link, Google Scholar
• Arnosti N, Johari R, Kanoria Y (2021) Managing congestion in matching markets. Manufacturing Service Oper. Management 23(3):620–636.Link, Google Scholar
• Ashlagi I, Krishnaswamy AK, Makhijani R, Saban D, Shiragur K (2022) Technical Note—Assortment planning for two-sided sequential matching markets. Oper. Res. 70(5):2784–2803.Google Scholar
• Ashlagi I, Burq M, Dutta C, Jaillet P, Saberi A, Sholley C (2019) Edge weighted online windowed matching. Proc. ACM Conf. on Econom. and Comput. (ACM, New York), 729–742.Google Scholar
• Bimpikis K, Papanastasiou Y, Zhang W (2020) Information provision in two-sided platforms: Optimizing for supply. Preprint, submitted July 1, https://dx.doi.org/10.2139/ssrn.3617351.Google Scholar
• Blanchet J, Gallego G, Goyal V (2016) A Markov chain approximation to choice modeling. Oper. Res. 64(4):886–905.Link, Google Scholar
• Börsch-Supan A (1990) On the compatibility of nested logit models with utility maximization. J. Econometrics 43(3):373–388.Crossref, Google Scholar
• Chan CW, Farias VF (2009) Stochastic depletion problems: Effective myopic policies for a class of dynamic optimization problems. Math. Oper. Res. 34(2):333–350.Link, 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 (2022) Technical Note—Capacitated assortment optimization: Hardness and approximation. Oper. Res. 70(2):893–904.Google Scholar
• Devanur NR, Jain K (2012) Online matching with concave returns. Proc. 44th Annual ACM Sympos. on Theory of Comput. (ACM, New York), 137–144.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, Mehta A, Mirrokni V, Muthukrishnan S (2009) Online stochastic matching: Beating 1-1/e. Proc. 50th Annual IEEE Sympos. on Foundations of Comput. Sci. (IEEE), 117–126.Google Scholar
• Gallego G, Li A, Truong V-A, Wang X (2020) Approximation algorithms for product framing and pricing. Oper. Res. 68(1):134–160.Link, Google Scholar
• Golrezaei N, Nazerzadeh H, Rusmevichientong P (2014) Real-time optimization of personalized assortments. Management Sci. 60(6):1532–1551.Link, Google Scholar
• Gong X-Y, Goyal V, Iyengar GN, Simchi-Levi D, Udwani R, Wang S (2022) Online assortment optimization with reusable resources. Management Sci. 68(7):4772–4785.Google Scholar
• Goyal V, Udwani R (2020) Online matching with stochastic rewards: Optimal competitive ratio via path based formulation. Proc. 21st ACM Conf. on Econom. and Comput. (ACM, New York), 791–791.Google Scholar
• Goyal V, Iyengar G, Udwani R (2020) Asymptotically optimal competitive ratio for online allocation of reusable resources. Preprint, submitted February 6, https://arxiv.org/abs/2002.02430.Google Scholar
• Gurvich I, Ward A (2015) On the dynamic control of matching queues. Stochastic Systems 4(2):479–523.Link, Google Scholar
• Jaillet P, Lu X (2013) Online stochastic matching: New algorithms with better bounds. Math. Oper. Res. 39(3):624–646.Link, Google Scholar
• Kalyanasundaram B, Pruhs KR (2000) An optimal deterministic algorithm for online b-matching. Theoretical Comput. Sci. 233(1–2):319–325.Crossref, Google Scholar
• Kanoria Y, Saban D (2021) Facilitating the search for partners on matching platforms. Management Sci. 67(10):5990–6029.Link, Google Scholar
• Kapralov M, Post I, Vondrák J (2013) Online submodular welfare maximization: Greedy is optimal. Proc. 24th Annual ACM-SIAM Sympos. on Discrete Algorithms (SIAM, Philadelphia), 1216–1225.Google Scholar
• Karp RM, Vazirani UV, Vazirani VV (1990) An optimal algorithm for on-line bipartite matching. Proc. 22nd Annual ACM Sympos. on Theory of Comput. (ACM, New York), 352–358.Google Scholar
• Lobe I (2021) Revenue management and the rise of the algorithmic economy. Management Sci. 67(9):5389–5398.Link, Google Scholar
• Ma W, Simchi-Levi D (2020) Algorithms for online matching, assortment, and pricing with tight weight-dependent competitive ratios. Oper. Res. 68(6):1787–1803.Link, 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
• Mehta A (2013) Online matching and ad allocation. Foundations Trends Theoretical Comput. Sci. 8(4):265–368.Crossref, Google Scholar
• Mehta A, Panigrahi D (2012) Online matching with stochastic rewards. Proc. IEEE 53rd Annual Sympos. on Foundations of Comput. Sci. (IEEE, New York), 728–737.Google Scholar
• Mehta A, Waggoner B, Zadimoghaddam M (2015) Online stochastic matching with unequal probabilities. Proc. 26th Annual ACM-SIAM Sympos. on Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 1388–1404.Google Scholar
• Mehta A, Saberi A, Vazirani U, Vazirani V (2005) Adwords and generalized on-line matching. Proc. 46th Annual IEEE Sympos. on Foundations of Comput. Sci. (IEEE, New York), 264–273.Google Scholar
• Motwani R, Raghavan P (1995) Randomized Algorithms (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Rios I, Saban D, Zheng F (2022) Improving match rates in dating markets through assortment optimization. Manufacturing Service Oper. Management, ePub ahead of print April 7, https://pubsonline.informs.org/doi/abs/10.1287/msom.2022.1107.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, Sumida M, Topaloglu H (2020) Dynamic assortment optimization for reusable products with random usage durations. Management Sci. 66(7):2820–2844.Link, Google Scholar
• Rusmevichientong P, Van Roy B, Glynn PW (2006) A nonparametric approach to multiproduct pricing. Oper. Res. 54(1):82–98.Link, Google Scholar
• Shi P (2022) Optimal priority-based allocation mechanisms. Management Sci. 68(1):171–188.Google Scholar
• Sumida M, Gallego G, Rusmevichientong P, Topaloglu H, Davis J (2020) Revenue-utility tradeoff in assortment optimization under the multinomial logit model with totally unimodular constraints. Management Sci. 67(5):2845–2869.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