Feature-Based Dynamic Matching

References

• Aggarwal CC (2016) Recommender Systems, vol. 1 (Springer International Publishing, Cham, Switzerland).Crossref, Google Scholar
• Ahani N, Gölz P, Procaccia AD, Teytelboym A, Trapp AC (2023) Dynamic placement in refugee resettlement. Oper. Res. 72(3):1087–1104.Link, Google Scholar
• Akbarpour M, Alimohammadi Y, Li S, Saberi A (2021) The value of excess supply in spatial matching markets. Preprint, submitted April 7, https://arxiv.org/abs/2104.03219.Google Scholar
• Albright C, Derman C (1972) Asymptotic optimal policies for the stochastic sequential assignment problem. Management Sci. 19(1):46–51.Link, Google Scholar
• Aouad A, Ma W (2022) A nonparametric framework for online stochastic matching with correlated arrivals. Preprint, submitted August 3, https://arxiv.org/abs/2208.02229.Google Scholar
• Aouad A, Saban D (2022) Online assortment optimization for two-sided matching platforms. Management Sci. 69(4):2069–2087.Link, Google Scholar
• Aouad A, Saritaç Ö (2022) Dynamic stochastic matching under limited time. Oper. Res. 70(4):2349–2383.Google Scholar
• Ashlagi I, Krishnaswamy AK, Makhijani R, Saban D, Shiragur K (2022a) Assortment planning for two-sided sequential matching markets. Oper. Res. 70(5):2784–2803.Link, Google Scholar
• Ashlagi I, Burq M, Dutta C, Jaillet P, Saberi A, Sholley C (2022b) Edge weighted online windowed matching. Math. Oper. Res. 48(2):999–1016.Google Scholar
• Bai Y, El Housni O, Jin B, Rusmevichientong P, Topaloglu H, Williamson DP (2023) Fluid approximations for revenue management under high-variance demand. Management Sci. 69(7):4016–4026.Link, Google Scholar
• Balkanksi E, Faenza Y, Perivier N (2022) The power of greedy for online minimum cost matching on the line. Preprint, submitted October 6, https://arxiv.org/abs/2210.03166.Google Scholar
• Balseiro SR, Besbes O, Pizarro D (2023a) Survey of dynamic resource-constrained reward collection problems: Unified model and analysis. Oper. Res. 72(5):2168–2189.Link, Google Scholar
• Balseiro S, Kroer C, Kumar R (2023b) Online resource allocation under horizon uncertainty. Abstr. Proc. ACM SIGMETRICS Internat. Conf. Measurement Modeling Comput. Systems (Association for Computing Machinery, New York), 63–64.Google Scholar
• Banerjee S, Freund D (2024) Good prophets know when the end is near. Management Sci. 71(6):4877–4894.Google Scholar
• Banerjee S, Freund D, Lykouris T (2022) Pricing and optimization in shared vehicle systems: An approximation framework. Oper. Res. 70(3):1783–1805.Link, Google Scholar
• Bertsekas D (2012) Dynamic Programming and Optimal Control: Volume I, vol. 4 (Athena Scientific, Belmont, MA).Google Scholar
• Besbes O, Sauré D (2014) Dynamic pricing strategies in the presence of demand shifts. Manufacturing Service Oper. Management 16(4):513–528.Link, Google Scholar
• Besbes O, Castro F, Lobel I (2022) Spatial capacity planning. Oper. Res. 70(2):1271–1291.Link, Google Scholar
• Besbes O, Kanoria Y, Kumar A (2024) Dynamic resource allocation: Algorithmic design principles and spectrum of achievable performances. Oper. Res. 73(3):1273–1288.Google Scholar
• Bitran G, Caldentey R (2003) An overview of pricing models for revenue management. Manufacturing Service Oper. Management 5(3):203–229.Link, Google Scholar
• Braverman M, Derakhshan M, Lovett AM (2022) Max-weight online stochastic matching: Improved approximations against the online benchmark. Preprint, submitted June 2, https://arxiv.org/abs/2206.01270.Google Scholar
• Brenier Y (1991) Polar factorization and monotone rearrangement of vector-valued functions. Comm. Pure Appl. Math. 44(4):375–417.Crossref, Google Scholar
• Brubach B, Sankararaman KA, Srinivasan A, Xu P (2016) New algorithms, better bounds, and a novel model for online stochastic matching. Proc. 24th Annual Eur. Sympos. Algorithms, Leibniz International Proceedings in Informatics (LIPIcs), vol. 57 (Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Wadern, Germany), 24:1–24:16.Google Scholar
• Bumpensanti P, Wang H (2020) A re-solving heuristic with uniformly bounded loss for network revenue management. Management Sci. 66(7):2993–3009.Link, Google Scholar
• Camacho EF, Alba CB (2013) Model Predictive Control (Springer Science & Business Media, Berlin).Google Scholar
• Caracciolo S, Lucibello C, Parisi G, Sicuro G (2014) Scaling hypothesis for the Euclidean bipartite matching problem. Phys. Rev. E 90(1):012118.Crossref, Google Scholar
• Chen L, Kyng R, Liu YP, Peng R, Gutenberg MP, Sachdeva S (2022) Maximum flow and minimum-cost flow in almost-linear time. Preprint, submitted March 1, https://arxiv.org/abs/2203.00671.Google Scholar
• Delong S, Farhadi A, Niazadeh R, Sivan B (2023) Online bipartite matching with reusable resources. Math. Oper. Res. 49(3):1825–1854.Google Scholar
• Derakhshan M, Golrezaei N, Manshadi V, Mirrokni V (2022) Product ranking on online platforms. Management Sci. 68(6):4024–4041.Link, Google Scholar
• Derman C, Lieberman GJ, Ross SM (1972) A sequential stochastic assignment problem. Management Sci. 18(7):349–355.Link, Google Scholar
• Ezra T, Feldman M, Gravin N, Tang ZG (2020) Online stochastic max-weight matching: Prophet inequality for vertex and edge arrival models. Proc. 21st ACM Conf. Econom. Comput. (EC '20) (Association for Computing Machinery, New York), 769–787.Google Scholar
• Feldman J, Mehta A, Mirrokni V, Muthukrishnan S (2009) Online stochastic matching: Beating 1-1/e. Proc. 50th Annual IEEE Sympos. Foundations Comput. Sci. (IEEE Computer Society, Washington, DC), 117–126.Google Scholar
• Feng Y, Niazadeh R (2024) Batching and optimal multi-stage bipartite allocations. Management Sci. 71(5):4108–4130.Google Scholar
• Gupta A, Guruganesh G, Peng B, Wajc D (2019) Stochastic online metric matching. Preprint, submitted April 19, https://arxiv.org/abs/1904.09284.Google Scholar
• Haeupler B, Mirrokni VS, Zadimoghaddam M (2011) Online stochastic weighted matching: Improved approximation algorithms. Chen N, Elkind E, Koutsoupias E, eds. Proc. 7th Internat. Workshop Internet Network Econom., Lecture Notes in Computer Science, vol. 7090 (Springer, Berlin, Heidelberg), 170–181.Google Scholar
• Holden N, Peres Y, Zhai A (2021) Gravitational allocation for uniform points on the sphere. Ann. Probability 49(1):287–321.Crossref, Google Scholar
• Immorlica N, Lucier B, Manshadi V, Wei A (2022) Designing approximately optimal search on matching platforms. Management Sci. 69(8):4609–4626.Google Scholar
• Jaillet P, Lu X (2014) Online stochastic matching: New algorithms with better bounds. Math. Oper. Res. 39(3):624–646.Link, Google Scholar
• Kanoria Y (2025) Dynamic spatial matching. Ann. Appl. Probab. 35(5):3086–3118.Google Scholar
• Koren Y, Bell R, Volinsky C (2009) Matrix factorization techniques for recommender systems. Computer 42(8):30–37.Crossref, Google Scholar
• Kunnumkal S, Talluri K, Topaloglu H (2012) A randomized linear programming method for network revenue management with product-specific no-shows. Transportation Sci. 46(1):90–108.Link, Google Scholar
• Ledoux M (2019) On optimal matching of gaussian samples. J. Math. Sci. 238(4):495–522.Crossref, 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
• Ma XN, Trudinger NS, Wang XJ (2005) Regularity of potential functions of the optimal transportation problem. Arch. Rational Mechanical Anal. 177:151–183.Crossref, Google Scholar
• Manole T, Niles-Weed J (2024) Sharp convergence rates for empirical optimal transport with smooth costs. Ann. Appl. Probab. 34(1B):1108–1135.Google Scholar
• Manole T, Balakrishnan S, Niles-Weed J, Wasserman L (2021) Plugin estimation of smooth optimal transport maps. Preprint, submitted July 26, https://arxiv.org/abs/2107.12364.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
• Manshadi V, Rodilitz S, Saban D, Suresh A (2025) Online algorithms for matching platforms with multi-channel traffic. Management Sci. 71(9):7674–7691.Google Scholar
• Murphy KP (2022) Probabilistic Machine Learning: An Introduction (MIT Press, Cambridge, MA).Google Scholar
• Niles-Weed J, Rigollet P (2022) Estimation of Wasserstein distances in the spiked transport model. Bernoulli 28(4):2663–2688.Google Scholar
• Papadimitriou C, Pollner T, Saberi A, Wajc D (2023) Online stochastic max-weight bipartite matching: Beyond prophet inequalities. Math. Oper. Res. 49(3):1607–1628.Google Scholar
• Saberi A, Yang M, Yu SH (2024) Stochastic online metric matching: Adversarial is no harder than stochastic. Preprint, submitted July 20, https://arxiv.org/abs/2407.14785.Google Scholar
• Shi P (2022) Optimal matchmaking strategy in two-sided marketplaces. Management Sci. 69(3):1323–1340.Link, Google Scholar
• Sinclair SR, Frujeri FV, Cheng CA, Marshall L, Barbalho HDO, Li J, Neville J, et al. (2023) Hindsight learning for MDPs with exogenous inputs. Krause A, Brunskill E, Cho K, Engelhardt B, Sabato S, Scarlett J, eds. Proc. Internat. Conf. Machine Learn. (PMLR, New York), 31877–31914.Google Scholar
• Su X, Zenios SA (2005) Patient choice in kidney allocation: A sequential stochastic assignment model. Oper. Res. 53(3):443–455.Link, Google Scholar
• Talluri K, Van Ryzin G (1999) A randomized linear programming method for computing network bid prices. Transportation Sci. 33(2):207–216.Link, Google Scholar
• Talluri KT, Van Ryzin G (2004) The Theory and Practice of Revenue Management, vol. 1 (Springer, Berlin).Crossref, Google Scholar
• Taşkesen B, Shafieezadeh-Abadeh S, Kuhn D (2023) Semi-discrete optimal transport: Hardness, regularization and numerical solution. Math. Programming 199:1033–1106. Crossref, Google Scholar
• Udwani R (2021) Periodic reranking for online matching of reusable resources. Preprint, submitted October 5, https://arxiv.org/abs/2110.02400.Google Scholar
• Vera A, Banerjee S (2021) The Bayesian prophet: A low-regret framework for online decision making. Management Sci. 67(3):1368–1391.Link, Google Scholar
• Villani C (2008) Optimal Transport: Old and New, vol. 338 (Springer, Berlin).Google Scholar
• Weed J, Bach F (2019) Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance. Bernoulli 25(4A):2620–2648.Crossref, Google Scholar