Dynamic Bipartite Matching Markets with Stochastic Arrivals and Departures

References

• [1] Abdulkadiroğlu A, Sönmez T (1999) House allocation with existing tenants. J. Econom. Theory 88(2):233–260.Crossref, Google Scholar
• [2] Akbarpour M, Li S, Gharan SO (2020) Thickness and information in dynamic matching markets. J. Political Econom. 128(3):783–815.Crossref, Google Scholar
• [3] Anderson R, Ashlagi I, Gamarnik D, Kanoria Y (2017) Efficient dynamic barter exchange. Oper. Res. 65(6):1446–1459.Link, Google Scholar
• [4] Anderson R, Ashlagi I, Gamarnik D, Roth AE (2015) Finding long chains in kidney exchange using the traveling salesman problem. Proc. Natl. Acad. Sci. USA 112(3):663–668.Crossref, Google Scholar
• [5] Ashlagi I, Roth AE (2014) Free riding and participation in large scale, multi-hospital kidney exchange. Theoret. Econom. 9(3):817–863.Crossref, Google Scholar
• [6] Ashlagi I, Burq M, Jaillet P, Manshadi V (2019) On matching and thickness in heterogeneous dynamic markets. Oper. Res. 67(4):927–949.Abstract, Google Scholar
• [7] Ashlagi I, Braverman M, Kanoria Y, Shi P (2020) Clearing matching markets efficiently: Informative signals and match recommendations. Management Sci. 66(5):2163–2193.Link, Google Scholar
• [8] Ashlagi I, Gamarnik D, Rees MA, Roth AE (2012) The need for (long) chains in kidney exchange. NBER Working Paper No. 18202, National Bureau of Economic Research, Cambridge, MA.Google Scholar
• [9] Ashlagi I, Azar Y, Charikar M, Chiplunkar A, Geri O, Kaplan H, Makhijani R, Wang Y, Wattenhofer R (2017) Min-cost bipartite perfect matching with delays. Approximation Randomization Combin. Optim. Algorithms Techniques (APPROX/RANDOM 2017) (Schloss Dagstuhl—Leibniz-Zentrum für Informatik, Wadern, Germany) 81(1):1–1:20.Google Scholar
• [10] Baccara M, Lee S, Yariv L (2020) Optimal dynamic matching. Theoret. Econom. 15(3):1221–1278.Crossref, Google Scholar
• [11] Bäumler J, Bullinger M, Kober S, Zhu D (2023) Superiority of instantaneous decisions in thin dynamic matching markets. Proc. 24th ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 390.Google Scholar
• [12] Cargopedia (2014) Cargopedia. Accessed December 23, 2019, https://www.cargopedia.net/.Google Scholar
• [13] Chen M, Sun P, Wan Z (2019) Matching supply and demand with mismatch-sensitive players. Preprint, submitted September 23, http://dx.doi.org/10.2139/ssrn.3458673.Google Scholar
• [14] Emek Y, Kutten S, Wattenhofer R (2016) Online matching: Haste makes waste! Proc. 48th Annual ACM Sympos. Theory Comput. (Association for Computing Machinery, New York), 333–344.Google Scholar
• [15] Feigenbaum I, Kanoria Y, Lo I, Sethuraman J (2020) Dynamic matching in school choice: Efficient seat reassignment after late cancellations. Management Sci. 66(11):5341–5361.Link, Google Scholar
• [16] Gupta V (2024) Greedy algorithm for multiway matching with bounded regret. Oper. Res. 72(3):1139–1155.Link, Google Scholar
• [17] Henzinger M, Khan S, Paul R, Schulz C (2020) Dynamic matching algorithms in practice. Preprint, submitted April 20, https://arxiv.org/abs/2004.09099.Google Scholar
• [18] Jiang W (2018) Bipartite matching model with dynamic arrivals and departures. Internat. J. Model. Simulation Sci. Comput. 9(4):1850031-1–1850031-18.Google Scholar
• [19] Johari R, Kamble V, Kanoria Y (2017) Matching while learning. Proc. 2017 ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 119.Google Scholar
• [20] Karger DR, Oh S, Shah D (2014) Budget-optimal task allocation for reliable crowdsourcing systems. Oper. Res. 62(1):1–24.Link, Google Scholar
• [21] Karp RM, Vazirani UV, Vazirani VV (1990) An optimal algorithm for on-line bipartite matching. Ortiz H, ed. Proc. 22nd Annual ACM Sympos. Theory Comput. (Association for Computing Machinery, New York), 352–358.Google Scholar
• [22] Kerimov S, Ashlagi I, Gurvich I (2023) On the optimality of greedy policies in dynamic matching. Oper. Res. 73(1):560–582.Link, Google Scholar
• [23] Kerimov S, Ashlagi I, Gurvich I (2024) Dynamic matching: Characterizing and achieving constant regret. Management Sci. 70(5):2799–2822.Link, Google Scholar
• [24] Ko BW (2021) Platform revolution in container shipping markets: An economics perspective. Ko BW, Song DW, eds. New Maritime Business: Uncertainty, Sustainability, Technology and Big Data (Springer, Cham, Switzerland), 127–145.Crossref, Google Scholar
• [25] Kojima F (2012) School choice: Impossibilities for affirmative action. Games Econom. Behav. 75(2):685–693.Crossref, Google Scholar
• [26] Kurino M (2020) Credibility, efficiency, and stability: A theory of dynamic matching markets. Japanese Econom. Rev. 71(1):135–165.Crossref, Google Scholar
• [27] Li S (2019) Deep learning for two-sided matching markets. PhD thesis, Harvard University, Cambridge, MA.Google Scholar
• [28] Li B, Cheng Y, Yuan Y, Wang G, Chen L (2019) Three-dimensional stable matching problem for spatial crowdsourcing platforms. Proc. 25th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (Association for Computing Machinery, New York), 1643–1653.Google Scholar
• [29] Ligon H (2021) Trust and transparency: How Uber freight forges customer relationships through tech. Accessed April 9, 2024, https://www.supplychain247.com/article/trust_and_transparency_how_uber_freight_forges_customer_relationships_throu/Freight_Transportation.Google Scholar
• [30] Loertscher S, Muir EV, Taylor PG (2022) Optimal market thickness. J. Econom. Theory 200:105383-1–105383-33.Crossref, Google Scholar
• [31] Manshadi V, Rodilitz S (2020) Online policies for efficient volunteer crowdsourcing. Proc. 21st ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 315–316.Google Scholar
• [32] Mehta A (2013) Online matching and ad allocation. Foundations Trends Theoret. Comput. Sci. 8(4):265–368.Crossref, Google Scholar
• [33] Mertikopoulos P, Nax HH, Pradelski BS (2020) Quick or cheap? Breaking points in dynamic markets. Proc. 21st ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 877–878.Google Scholar
• [34] Norris JR (1998) Markov Chains (Cambridge University Press, Cambridge, UK).Google Scholar
• [35] Özkan E, Ward AR (2020) Dynamic matching for real-time ride sharing. Stochastic Systems 10(1):29–70.Link, Google Scholar
• [36] Park A, Chen R, Cho S, Zhao Y (2023) The determinants of online matching platforms for freight services. Transportation Res. Part E Logist. Transportation Rev. 179:103284-1–103284-15.Crossref, Google Scholar
• [37] Parker GG, Van Alstyne MW, Choudary SP (2016) Platform Revolution: How Networked Markets Are Transforming the Economy and How to Make Them Work for You (W. W. Norton & Company, New York).Google Scholar
• [38] Ross LF, Rubin DT, Siegler M, Josephson MA, Thistlethwaite JR Jr, Woodle ES (1997) Ethics of a paired-kidney-exchange program. New England J. Medicine 336(24):1752–1755.Crossref, Google Scholar
• [39] Ünver MU (2010) Dynamic kidney exchange. Rev. Econom. Stud. 77(1):372–414.Crossref, Google Scholar
• [40] Wang H, Yang H (2019) Ridesourcing systems: A framework and review. Transportation Res. Part B Methodological 129:122–155.Crossref, Google Scholar
• [41] Wtransnet (1996) Wtransnet. Accessed January 24, 2021, https://www.wtransnet.com/.Google Scholar
• [42] Yang B, Han K, Tu W, Ge Q (2023) Fairness in online vehicle-cargo matching: An intuitionistic fuzzy set theory and tripartite evolutionary game approach. Preprint, submitted October 28, https://arxiv.org/abs/2310.18657.Google Scholar