Matching Impatient and Heterogeneous Demand and Supply

References

• Abdulkadiroglu A, Sönmez T (2013) Matching markets: Theory and practice. Acemoglu D, Arello M, Dekel E, eds. Advances in Economics and Econometrics: Tenth World Congress, Econometric Society Monographs, vol. 1 (Cambridge University Press, Cambridge, UK), 3–47.Crossref, Google Scholar
• Adan I, Weiss G (2012) Exact FCFS matching rates for two infinite multitype sequences. Oper. Res. 60(2):475–489.Link, Google Scholar
• Adan I, Weiss G (2014) A skill based parallel service system under FCFS-ALIS-steady state, overloads, and abandonments. Stochastic Systems 4(1):250–299.Link, Google Scholar
• Adan I, Bušić A, Mairesse J, Weiss G (2018) Reversibility and further properties of FCFS infinite bipartite matching. Math. Oper. Res. 43(2):598–621.Link, Google Scholar
• Afèche P, Caldentey R, Gupta V (2022) On the optimal design of a bipartite matching queueing system. Oper. Res. 70(1):363–401.Link, Google Scholar
• Afèche P, Diamont A, Milner J (2014) Double-sided batch queues with abandonments: Modeling crossing networks. Oper. Res. 62(5):1179–1201.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, 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
• Atar R, Giat C, Shimkin N (2011) On the asymptotic optimality of the cμ/θ rule under ergodic cost. Queueing Systems 67(2):127–144.Crossref, Google Scholar
• Atar R, Budhiraja A, Dupuis P, Wu R (2022) Large deviations for the single-server queue and the reneging paradox. Math. Oper. Res. 47(1):232–258.Link, Google Scholar
• Atar R, Kang W, Kaspi H, Ramanan K (2023) Large-time limit of nonlinearly coupled measure-valued equations that model many-server queues with reneging. SIAM J. Mathematical Anal. 55(6):7189–7239.Google Scholar
• Aveklouris A, Ward AR, Puha AL (2023) A fluid approximation for a matching model with general reneging distributions. Queueing Syst., ePub ahead of print September 26, https://doi.org/10.1007/s11134-023-09892-w.Google Scholar
• Banerjee S, Kanoria Y, Qian P (2018) Large deviations optimal scheduling of closed queueing networks. Preprint, submitted March 13, https://arxiv.org/abs/1803.04959.Google Scholar
• Benjaafar S, Hu M (2020) Operations management in the age of the sharing economy: What is old and what is new? Manufacturing Service Oper. Management 22(1):93–101.Link, Google Scholar
• Bertsimas D, Kung J, Trichakis N, Wang Y, Hirose R, Vagefi PA (2019) Development and validation of an optimized prediction of mortality for candidates awaiting liver transplantation. Amer. J. Transplantation 19(4):1109–1118.Crossref, Google Scholar
• Billingsley P (1999) Convergence of Probability Measures, 2nd ed. (Wiley, New York).Crossref, Google Scholar
• Blanchet JH, Reiman MI, Shah V, Wein LM, Wu L (2022) Asymptotically optimal control of a centralized dynamic matching market with general utilities. Oper. Res. 70(6):3355–3370.Link, Google Scholar
• Boxma OJ, David I, Perry D, Stadje W (2011) A new look at organ transplantation models and double matching queues. Probab. Engrg. Inform. Sci. 25(2):135–155.Crossref, Google Scholar
• Brown L, Gans N, Mandelbaum A, Sakov A, Shen H, Zeltyn S, Zhao L (2005) Statistical analysis of a telephone call center: A queueing-science perspective. J. Amer. Statist. Assoc. 100(469):36–50.Crossref, Google Scholar
• Büke B, Chen H (2017) Fluid and diffusion approximations of probabilistic matching systems. Queueing Systems 86(1–2):1–33.Crossref, Google Scholar
• Bušić A, Gupta V, Mairesse J (2013) Stability of the bipartite matching model. Adv. Appl. Probab. 45(2):351–378.Crossref, 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
• Castro F, Nazerzadeh H, Yan C (2020) Matching queues with reneging: A product form solution. Queueing Systems 96(3–4):359–385.Crossref, Google Scholar
• Chen YJ, Dai T, Korpeoglu CG, Körpeoğlu E, Sahin O, Tang CS, Xiao S (2020) OM forum-innovative online platforms: Research opportunities. Manufacturing Service Oper. Management 22(3):430–445.Link, Google Scholar
• Diamant A, Baron O (2019) Double-sided matching queues: Priority and impatient customers. Oper. Res. Lett. 47(3):219–224.Crossref, Google Scholar
• Ding Y, McCormick ST, Nagarajan M (2021) A fluid model for one-sided bipartite matching queues with match-dependent rewards. Oper. Res. 69(4):1256–1281.Link, Google Scholar
• Fazel-Zarandi MM, Kaplan EH (2018) Approximating the first-come, first-served stochastic matching model with Ohm’s law. Oper. Res. 66(5):1423–1432.Link, Google Scholar
• Gale D, Shapley LS (1962) College admissions and the stability of marriage. Amer. Math. Monthly 69(1):9–15.Crossref, Google Scholar
• Gross JL, Yellen J, Anderson M (2018) Graph Theory and Its Applications (Chapman and Hall/CRC, Boca Raton, FL).Crossref, Google Scholar
• Gurvich I, Ward A (2014) On the dynamic control of matching queues. Stochastic Systems 4(2):479–523.Link, Google Scholar
• Harrison JM (1996) The BIGSTEP approach to flow management in stochastic processing networks. Kelly F, Zachary S, Ziedins I, eds. Stochastic Networks: Theory and Applications, vol. 4 (Oxford University Press, Oxford, UK), 147–186.Crossref, Google Scholar
• Harrison JM (2006) Correction: Brownian models of open processing networks: Canonical representation of workload. Ann. Appl. Probab. 16(3):1703–1732.Crossref, Google Scholar
• Hu M, ed. (2019) Sharing Economy: Making Supply Meet Demand, Springer Series in Supply Chain Management (Springer, Berlin, Heidelberg).Crossref, Google Scholar
• Hu M (2021) From the classics to new tunes: A neoclassical view on sharing economy and innovative marketplaces. Production Oper. Management 30(6):1668–1685.Crossref, Google Scholar
• Jonckheere M, Moyal P, Ramírez C, Soprano-Loto N (2023) Generalized max-weight policies in stochastic matching. Stochastic Systems 13(1):40–58.Link, Google Scholar
• Kang W, Ramanan K (2010) Fluid limits of many-server queues with reneging. Ann. Appl. Probab. 20(6):2204–2260.Crossref, Google Scholar
• Kang W, Ramanan K (2012) Asymptotic approximations for stationary distributions of many-server queues with abandonment. Ann. Appl. Probab. 22(2):477–521.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
• Kerimov S, Ashlagi I, Gurvich I (2023) On the optimality of greedy policies in dynamic matching. Oper. Res., ePub ahead of print September 12, https://doi.org/10.1287/opre.2021.0596.Google Scholar
• Khademi A, Liu X (2021) Asymptotically optimal allocation policies for transplant queueing systems. SIAM J. Appl. Math. 81(3):1116–1140.Crossref, Google Scholar
• Kohlenberg A, Gurvich I (2023) The cost of impatience in dynamic matching: Scaling laws and operating regimes. Preprint, submitted May 25, https://dx.doi.org/10.2139/ssrn.4453900.Google Scholar
• Liu X (2019) Diffusion models for double-ended queues with reneging in heavy traffic. Queueing Systems 91(1–2):49–87.Crossref, Google Scholar
• Maglaras C (1999) Dynamic scheduling in multiclass queueing networks: Stability under discrete-review policies. Queueing Systems 31(3–4):171–206.Crossref, Google Scholar
• Maglaras C (2000) Discrete-review policies for scheduling stochastic networks: Trajectory tracking and fluid-scale asymptotic optimality. Ann. Appl. Probab. 10(3):897–929.Crossref, Google Scholar
• Mandelbaum A, Zeltyn S (2013) Data-stories about (im)patient customers in tele-queues. Queueing Systems 75(2):115–146.Crossref, Google Scholar
• Masanet T, Moyal P (2024) Perfect sampling of stochastic matching models with reneging. Adv. Appl. Probab. 1–32.Google Scholar
• Özkan E (2020) Joint pricing and matching in ride-sharing systems. Eur. J. Oper. Res. 287(3):1149–1160.Crossref, Google Scholar
• Özkan E, Ward AR (2020) Dynamic matching for real-time ride sharing. Stochastic Systems 10(1):29–70.Link, Google Scholar
• Puha AL, Ward AR (2019) Scheduling an overloaded multiclass many-server queue with impatient customers. Tutorials in Operations Research: Operations Research & Management Science in the Age of Analytics (INFORMS, Catonsville, MD), 189–217.Link, Google Scholar
• Roth AE, Sotomayor M (1990) Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis, Econometric Society Monographs (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Smith W (1956) Various optimizers for single-stage production. Naval Res. Logist. Quart. 3(1–2):59–66.Crossref, Google Scholar
• Wang G, Zhang H, Zhang J (2023) On-demand ride-matching in a spatial model with abandonment and cancellation. Oper. Res., ePub ahead of print November 18, https://doi.org/10.1287/opre.2022.2399.Google Scholar
• Whitt W (2006) Fluid models of many-server queues with abandonment. Oper. Res. 54(1):37–54.Link, Google Scholar
• Zenios SA (1999) Modeling the transplant waiting list: A queueing model with reneging. Queueing Systems 31(3–4):239–251.Crossref, Google Scholar
• Zhang J (2013) Fluid models of many-server queues with abandonment. Queueing Systems 73(2):147–193.Crossref, Google Scholar
• Zubeldia M, Jhunjhunwala PJ, Maguluri ST (2022) Matching queues with abandonments in quantum switches: Stability and throughput analysis. Preprint, submitted September 25, https://arxiv.org/abs/2209.12324.Google Scholar