Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities

References

• Adan I, Weiss G (2012) Exact FCFS matching rates for two infinite multitype sequences. Oper. Res. 60(2):475–489.Link, Google Scholar
• Agarwal N (2015) An empirical model of the medical match. Amer. Econom. Rev. 105(7):1939–1978.Crossref, Google Scholar
• Akbarpour M, Li S, Oveis Gharan S (2020) Thickness and information in dynamic matching markets. J. Political Econom. 128(3):783–815.Crossref, Google Scholar
• Aldous DJ (2001) The ζ(2) limit in the random assignment problem. Random Structures Algorithms 18(4):381–418.Crossref, Google Scholar
• Anderson R, Ashlagi I, Kanoria Y, Gamarnik D (2017) Efficient dynamic bargain exchange. Oper. Res. 65(6):1446–1459.Link, Google Scholar
• Ashlagi I, Jaillet P, Manshadi PH (2013) Kidney exchange in dynamic sparse heterogenous pools. Preprint, submitted January 15, https://arxiv.org/abs/1301.3509.Google Scholar
• Ashlagi I, Kanoria Y, Leshno JD (2017a) Unbalanced random matching markets: The stark effect of competition. J. Political Econom. 125(1):69–98.Crossref, Google Scholar
• Ashlagi I, Nikzad A, Strack P (2018a) Matching in dynamic imbalanced markets. Preprint, submitted September 18, https://arxiv.org/abs/1809.06824.Google Scholar
• 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
• Ashlagi I, Burq M, Dutt C, Jaillet P, Saberi A, Sholley C (2018b) Maximum weight online matching with deadlines. Preprint, submitted August 9, https://arxiv.org/abs/1808.03526.Google Scholar
• Ashlagi I, Azar Y, Charikar M, Chiplunkar A, Geri O, Kaplan H, Makhijani R, et al. (2017b) Min-cost bipartite perfect matching with delays. Jansen K, Rolim JDP, Williamson D, Vempala SS, eds. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Schloss Dagstuhl–Leibniz-Zentrum fur Informatik, Dagstuhl, Germany), 1–20.Google Scholar
• Baccara M, Lee S, Yariv L (2020) Optimal dynamic matching. Theoret. Econom. 15(3):1221–1278.Google Scholar
• Bojanic R, Seneta E (1971) Slowly varying functions and asymptotic relations. J. Math. Anal. Appl. 34(2):302–315.Crossref, Google Scholar
• Boyd D, Lankford H, Loeb S, Wyckoff J (2013) Analyzing the determinants of the matching of public school teachers to jobs: Estimating compensating differentials in imperfect labor markets. J. Labor Econom. 31(1):83–117.Crossref, Google Scholar
• Büke B, Chen H (2017) Fluid and diffusion approximations of probabilistic matching systems. Queueing Systems 86:1–33.Crossref, Google Scholar
• Bušić A, Meyn S (2015) Approximate optimality with bounded regret in dynamic matching models. ACM Sigmetrics Performance Evaluation Rev. 43(2):75–77.Google Scholar
• Caldentey R, Kaplan EH, Weiss G (2009) FCFS infinite bipartite matching of servers and customers. Adv. Appl. Probab. 41(3):695–730.Crossref, Google Scholar
• Ding Y, McCormick ST, Nagarajan M (2021) A fluid model for one-sided bipartite queues with match-dependent rewards. Oper. Res. 69(4):1256–1281.Google Scholar
• Duffie D, Qiao L, Sun Y (2018) Dynamic directed random matching. J. Econom. Theory 174:124–183.Crossref, Google Scholar
• Emek Y, Kutten S, Wattenhofer R (2016) Online matching: Haste makes waste! Proc. 48th Annual ACM SIGACT Sympos. Theory Comput. (ACM, New York), 333–344.Google Scholar
• Ethier SN, Kurtz TG (2005) Markov Processes: Characterization and Convergence (John Wiley & Sons, New York).Google Scholar
• Galambos J (1978) The Asymptotic Theory of Extreme Order Statistics (Wiley, New York).Google Scholar
• Gans N, Koole G, Mandelbaum A (2003) Telephone call centers: Tutorial, review, and research prospects. Manufacturing Service Oper. Management 5(2):79–141.Link, Google Scholar
• Gumbel EJ (1958) Statistics of Extremes (Columbia University Press, New York).Crossref, Google Scholar
• Gurvich I, Ward A (2014) On the dynamic control of matching queues. Stochastic Systems 4(2):479–523.Link, Google Scholar
• Hitsch GJ, Hortacsu A, Ariely D (2010) Matching and sorting in online dating. Amer. Econom. Rev. 100(1):130–163.Crossref, Google Scholar
• Hu M, Zhou Y (2021) Dynamic type matching. Manufacturing Service Oper. Management, ePub ahead of print March 18, https://doi.org/10.1287/msom.2020.0952.Link, Google Scholar
• Kaplan EH (1988) A public housing queue with reneging and task-specific servers. Decision Sci. 19(2):383–391.Crossref, Google Scholar
• Karp RM, Vazirani UV, Vazirani VV (1990) An optimal algorithm for on-line bipartite matching. Proc. 22nd Annual ACM Sympos. Theory Comput. (ACM, New York), 352–358.Google Scholar
• Liu X, Gong Q, Kulkarni VG (2015) Diffusion models for double-ended queues with renewal arrival processes. Stochastic Systems 5(1):1–61.Link, Google Scholar
• Mertikopoulos P, Nax HH, Pradelski BSR (2020) Quick or cheap? Breaking points in dynamic markets. Preprint, submitted January 20, https://arxiv.org/abs/2001.00468.Google Scholar
• Mezard M, Parisi G (1987) On the solution of the random link matching problems. J. Phys. 48(9):1451–1459.Crossref, Google Scholar
• Moyal P, Perry O (2017) On the instability of matching queues. Ann. Appl. Probab. 27(6):3385–3434.Crossref, Google Scholar
• Nazari M, Stolyar AL (2019) Reward maximization in general dynamic matching systems. Queueing Systems 91:143–170.Crossref, Google Scholar
• Reed J, Tezcan T (2012) Hazard rate scaling of the abandonment distribution for the GI/M/n+GI queue in heavy traffic. Oper. Res. 60(4):981–995.Link, Google Scholar
• Resnick S (1987) Extreme Values, Regular Variation, and Point Processes (Springer, New York).Crossref, Google Scholar
• Ünver MU (2010) Dynamic kidney exchange. Rev. Econom. Stud. 77(1):372–414.Crossref, Google Scholar
• Varma SM, Bumpensanti P, Maguluri ST, Wang H (2019) Dynamic pricing and matching in two-sided queues. Preprint, submitted November 6, https://arxiv.org/abs/1911.02213.Google Scholar