Online Algorithms for Matching Platforms with Multichannel Traffic

References

• Alaei S, Hajiaghayi MT, Liaghat V (2013) The online stochastic generalized assignment problem. Raghavendra P, Raskhodnikova S, Jansen K, Rolim JDP, eds. Approximation Randomization Combin. Optim. Algorithms Techniques. APPROX RANDOM 2013, Lecture Notes in Computer Science, vol. 8096 (Springer, Berlin, Heidelberg), 11–25.Google Scholar
• Alaei S, Makhdoumi A, Malekian A, Pekeč S (2022) Revenue-sharing allocation strategies for two-sided media platforms: Pro-rata vs. user-centric. Management Sci. 68(12):8699–8721.Link, Google Scholar
• Aouad A, Saban D (2023) Online assortment optimization for two-sided matching platforms. Management Sci. 69(4):2069–2087.Link, Google Scholar
• Arnosti N, Shi P (2020) Design of lotteries and wait-lists for affordable housing allocation. Management Sci. 66(6):2291–2307.Link, Google Scholar
• Ashlagi I, Krishnaswamy AK, Makhijani R, Saban D, Shiragur K (2022) Assortment planning for two-sided sequential matching markets. Oper. Res. 70(5):2784–2803.Link, Google Scholar
• Balseiro SR, Lu H, Mirrokni V (2023) The best of many worlds: Dual mirror descent for online allocation problems. Oper. Res. 71(1):101–119.Link, Google Scholar
• Besbes O, Castro F, Lobel I (2021) Surge pricing and its spatial supply response. Management Sci. 67(3):1350–1367.Link, Google Scholar
• Bimpikis K, Candogan O, Saban D (2019) Spatial pricing in ride-sharing networks. Oper. Res. 67(3):744–769.Link, Google Scholar
• Buchbinder N, Naor JS (2009) The design of competitive online algorithms via a primal–dual approach. Foundations Trends Theoret. Comput. Sci. 3(2–3):93–263.Crossref, Google Scholar
• Buchbinder N, Jain K, Naor JS (2007) Online primal-dual algorithms for maximizing ad-auctions revenue. Arge L, Hoffmann M, Welzl E, eds. Eur. Sympos. Algorithms. ESA 2007, Lecture Notes in Computer Science, vol. 4698 (Springer, Berlin, Heidelberg), 253–264.Google Scholar
• Castro F, Ma H, Nazerzadeh H, Yan C (2021) Randomized FIFO mechanisms. Preprint, submitted November 21, https://arxiv.org/abs/2111.10706.Google Scholar
• Désir A, Goyal V, Zhang J (2021) Technical note—Capacitated assortment optimization: Hardness and approximation. Oper. Res. 70(2):893–904.Link, Google Scholar
• Dzyabura D, Jagabathula S (2018) Offline assortment optimization in the presence of an online channel. Management Sci. 64(6):2767–2786.Link, Google Scholar
• Elmachtoub AN, Goyal V, Lederman R, Sheth H (2022) Revenue management with product retirement and customer selection. Hansen KA, Liu TX, Malekian A, eds. Web Internet Econom. 18th Internat. Conf. WINE 2022, Lecture Notes in Computer Science, vol. 13778 (Springer Nature, Cham, Switzerland), 358.Google Scholar
• Esfandiari H, Korula N, Mirrokni V (2015) Online allocation with traffic spikes: Mixing adversarial and stochastic models. Proc. 16th ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 169–186.Google Scholar
• Feldman J, Segev D (2022) Technical note—The multinomial logit model with sequential offerings: Algorithmic frameworks for product recommendation displays. Oper. Res. 70(4):2162–2184.Link, Google Scholar
• Feng Y, Niazadeh R (2024) Batching and optimal multi-stage bipartite allocations. Management Sci., ePub ahead of print August 30, https://doi.org/10.1287/mnsc.2022.03698.Google Scholar
• Feng Y, Niazadeh R, Saberi A (2019) Linear programming based online policies for real-time assortment of reusable resources. Chicago Booth Research Paper No. 20-25, University of Chicago Booth School of Business, Chicago.Google Scholar
• Freund D, Lykouris T, Paulson E, Sturt B, Weng W (2023) Group fairness in dynamic refugee assignment. Preprint, submitted January 25, https://arxiv.org/abs/2301.10642.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 (2021) Online assortment optimization with reusable resources. Management Sci. 68(7):4772–4785.Link, Google Scholar
• Goyal V, Udwani R (2023) Online matching with stochastic rewards: Optimal competitive ratio via path-based formulation. Oper. Res. 71(2):563–580.Link, 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
• Hwang D, Jaillet P, Manshadi V (2021) Online resource allocation under partially predictable demand. Oper. Res. 69(3):895–915.Link, Google Scholar
• Immorlica N, Lucier B, Manshadi V, Wei A (2022) Designing approximately optimal search on matching platforms. Management Sci. 69(8):4609–4626.Link, Google Scholar
• Kalyanasundaram B, Pruhs KR (2000) An optimal deterministic algorithm for online B-matching. Theoret. 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
• Karp RM, Vazirani UV, Vazirani VV (1990) An optimal algorithm for on-line bipartite matching. Proc. 22nd Annual ACM Sympos. Theory Comput. (Association for Computing Machinery, New York), 352–358.Google Scholar
• Kumar R, Purohit M, Schild A, Svitkina Z, Vee E (2018) Semi-online bipartite matching. Preprint, submitted December 1, https://arxiv.org/abs/1812.00134.Google Scholar
• Lo I, Manshadi V, Rodilitz S, Shameli A (2024) Commitment on volunteer crowdsourcing platforms: Implications for growth and engagement. Manufacturing Service Oper. Management 26(5):1787–1805.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 V, Rodilitz S (2022) Online policies for efficient volunteer crowdsourcing. Management Sci. 68(9):6572–6590.Link, Google Scholar
• Manshadi V, Rodilitz S, Saban D, Suresh A (2023) Redesigning VolunteerMatch’s ranking algorithm: Toward more equitable access to volunteers. Preprint, submitted July 5, http://dx.doi.org/10.2139/ssrn.4497747.Google Scholar
• Mehta A (2013) Online matching and ad allocation. Foundations Trends Theoret. Comput. Sci. 8(4):265–368.Crossref, Google Scholar
• Mehta A, Panigrahi D (2012) Online matching with stochastic rewards. 2012 IEEE 53rd Annual Sympos. Foundations Comput. Sci. (IEEE, Piscataway, NJ), 728–737.Google Scholar
• Mehta A, Saberi A, Vazirani U, Vazirani V (2007) AdWords and generalized online matching. J. ACM 54(5):22-es.Crossref, Google Scholar
• Naor J, Wajc D (2018) Near-optimum online ad allocation for targeted advertising. ACM Trans. Econom. Comput. 6(3–4):1–20.Crossref, Google Scholar
• Ríos I, Saban D, Zheng F (2023) Improving match rates in dating markets through assortment optimization. Manufacturing Service Oper. Management 25(4):1304–1323.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
• Sampson SE (2006) Optimization of volunteer labor assignments. J. Oper. Management 24(4):363–377.Crossref, Google Scholar
• Udwani R (2023) AdWords with unknown budgets and beyond. Proc. 24th ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 1128.Google Scholar