Data-Driven Matching for Impatient and Heterogeneous Demand and Supply

References

• [1] Afèche P, Diamant A, Milner J (2014) Double-sided batch queues with abandonment: Modeling crossing networks. Oper. Res. 62(5):1179–1201.Link, Google Scholar
• [2] Arcones MA (1996) The Bahadur-Kiefer representation for U-quantiles. Ann. Statist. 24(3):1400–1422.Crossref, Google Scholar
• [3] Arnosti N, Johari R, Kanoria Y (2021) Managing congestion in matching markets. Manufacturing Service Oper. Management 23(3):620–636.Link, Google Scholar
• [4] Aveklouris A, Puha AL, Ward AR (2024a) A fluid approximation for a matching model with general reneging distributions. Queueing Systems 106(3):199–238.Crossref, Google Scholar
• [5] Aveklouris A, DeValve L, Stock M, Ward A (2024b) Matching impatient and heterogeneous demand and supply. Oper. Res. 73(3):1637–1658.Link, Google Scholar
• [6] Bahadur RR (1966a) A note on quantiles in large samples. Ann. Math. Statist. 37(3):577–580. Crossref, Google Scholar
• [7] Ban GY (2020) Confidence intervals for data-driven inventory policies with demand censoring. Oper. Res. 68(2):309–326.Abstract, Google Scholar
• [8] 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
• [9] Basu S, Sankararaman KA, Sankararaman A (2021) Beyond log2(t) regret for decentralized bandits in matching markets. Internat. Conf. Machine Learn, Proceedings of Machine Learning Research, vol. 139 (PMLR, New York), 705–715.Google Scholar
• [10] Besbes O, Mouchtaki O (2023) How big should your data really be? Data-driven newsvendor: Learning one sample at a time. Management Sci. 69(10):5848–5865.Link, Google Scholar
• [11] 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
• [12] 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
• [13] Braverman A, Dai JG, Liu X, Ying L (2019) Empty-car routing in ridesharing systems. Oper. Res. 67(5):1437–1452.Link, Google Scholar
• [14] Bu J, Simchi-Levi D, Wang L (2023) Offline pricing and demand learning with censored data. Management Sci. 69(2):885–903.Link, Google Scholar
• [15] Cao P, He S, Huang J, Liu Y (2021) To pool or not to pool: Queueing design for large-scale service systems. Oper. Res. 69(6):1866–1885.Link, Google Scholar
• [16] Cen SH, Shah D (2022) Regret, stability & fairness in matching markets with bandit learners. Internat. Conf. Artificial Intelligence Statist. (PMLR, New York), 8938–8968.Google Scholar
• [17] Chen X, Liu Y, Hong G (2024) An online learning approach to dynamic pricing and capacity sizing in service systems. Oper. Res. 72(6):2677–2697.Link, Google Scholar
• [18] Chen X, Liu W, Zhang Y (2019) Quantile regression under memory constraint. Ann. Statist. 47(6):3244–3273.Crossref, Google Scholar
• [19] Cohen A, Subramanian V, Zhang Y (2024) Learning-based optimal admission control in a single-server queuing system. Stochastic Systems 14(1):69–107.Link, Google Scholar
• [20] Csorgo M, Revesz P (1978) Strong approximations of the quantile process. Ann. Statist. 6(4):882–894.Crossref, Google Scholar
• [21] Csorgo M, Csorgo S, Horvath L, Mason DM (1986) Weighted empirical and quantile processes. Ann. Probab. 14(1):31–85.Crossref, Google Scholar
• [22] Deheuvels P (1984) Strong limit theorems for maximal spacings from a general univariate distribution. Ann. Probab. 12(4):1181–1193.Crossref, Google Scholar
• [23] 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
• [24] Elmachtoub AN, Liang JCN, McNellis R (2020) Decision trees for decision-making under the predict-then-optimize framework. Internat. Conf. Machine Learn, Proceedings of Machine Learning Research, vol. 119 (PMLR, New York), 2858–2867. Google Scholar
• [25] Freund D, Lykouris T, Weng W (2023) Quantifying the cost of learning in queueing systems. Adv. Neural Inform. Processing Systems, vol. 36 (Curran Associates, Red Hook, NY), 6532–6544.Google Scholar
• [26] Gurvich I, Ward A (2015) On the dynamic control of matching queues. Stochastic Systems 4(2):479–523.Link, Google Scholar
• [27] Hssaine C, Sinclair SR (2024) The data-driven censored newsvendor problem. Preprint, submitted December 2, https://arxiv.org/abs/2412.01763.Google Scholar
• [28] Hsu WK, Xu J, Lin X, Bell MR (2022) Integrated online learning and adaptive control in queueing systems with uncertain payoffs. Oper. Res. 70(2):1166–1181.Link, Google Scholar
• [29] Huang Z, Mansour Y, Roughgarden T (2015) Making the most of your samples. EC’15: Proc. 16th ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 45–60.Google Scholar
• [30] Jagadeesan M, Wei A, Wang Y, Jordan M, Steinhardt J (2021) Learning equilibria in matching markets from bandit feedback. Adv. Neural Inform. Processing Systems, vol. 34 (Curran Associates, Inc., Red Hook, NY), 3323–3335. Google Scholar
• [31] Jia H, Shi C, Shen S (2024) Online learning and pricing for service systems with reusable resources. Oper. Res. 72(3):1203–1241.Link, Google Scholar
• [32] Johari R, Kamble V, Kanoria Y (2021) Matching while learning. Oper. Res. 69(2):655–681.Link, Google Scholar
• [33] Kalvit A, Zeevi A (2022) Dynamic learning in large matching markets. Adv. Neural Inform. Processing Systems, vol. 35 (Curran Associates, Red Hook, NY), 20770–20781.Google Scholar
• [34] Kanoria Y, Saban D (2021) Facilitating the search for partners on matching platforms. Management Sci. 67(10):5990–6029.Link, Google Scholar
• [35] Khademi A, Liu X (2021) Asymptotically optimal allocation policies for transplant queueing systems. SIAM J. Appl. Math. 81(3):1116–1140.Crossref, Google Scholar
• [36] Koenker R, Hallock KF (2001) Quantile regression. J. Econom. Perspect. 15(4):143–156.Crossref, Google Scholar
• [37] Kohlenberg A, Gurvich I (2025) The cost of impatience in dynamic matching: Scaling laws and operating regimes. Management Sci. 71(4):3303–3319.Link, Google Scholar
• [38] Krishnasamy S, Sen R, Johari R, Shakkottai S (2021) Learning unknown service rates in queues: A multiarmed bandit approach. Oper. Res. 69(1):315–330.Link, Google Scholar
• [39] Lei J (2020) Convergence and concentration of empirical measures under Wasserstein distance in unbounded functional spaces. Bernoulli 26(1):767–798.Crossref, Google Scholar
• [40] Levi R, Roundy RO, Shmoys DB (2007) Provably near-optimal sampling-based policies for stochastic inventory control models. Math. Oper. Res. 32(4):821–839.Link, Google Scholar
• [41] Lin M, Huh WT, Krishnan H, Uichanco J (2022) Data-driven newsvendor problem: Performance of the sample average approximation. Oper. Res. 70(4):1996–2012.Link, Google Scholar
• [42] Liu W (2026) Code for reproduction: Data-driven matching for impatient and heterogeneous demand and supply. https://zenodo.org/records/18877703.Google Scholar
• [43] Liu LT, Ruan F, Mania H, Jordan MI (2021) Bandit learning in decentralized matching markets. J. Machine Learn. Res. 22(211):1–34.Google Scholar
• [44] Mandelbaum A, Zeltyn S (2013) Data-stories about (im) patient customers in tele-queues. Queueing Systems 75(2):115–146.Crossref, Google Scholar
• [45] Masanet T, Moyal P (2024) Perfect sampling of stochastic matching models with reneging. Adv. Appl. Probab. 56(4):1307–1339.Crossref, Google Scholar
• [46] Mišić VV, Perakis G (2020) Data analytics in operations management: A review. Manufacturing Service Oper. Management 22(1):158–169.Link, Google Scholar
• [47] Özkan E (2020) Joint pricing and matching in ride-sharing systems. Eur. J. Oper. Res. 287(3):1149–1160.Crossref, Google Scholar
• [48] Özkan E, Ward AR (2020) Dynamic matching for real-time ride sharing. Stochastic Systems 10(1):29–70.Link, Google Scholar
• [49] Prashanth L, Bhat SP (2022) A Wasserstein distance approach for concentration of empirical risk estimates. J. Machine Learn. Res. 23(238):1–61.Google Scholar
• [50] Sun X, Chai S, Zhao J (2023) Congestion-aware matching and learning for service platforms. Preprint, submitted May 19, https://doi.org/10.2139/ssrn.5258944.Google Scholar
• [51] van der Vaart AW (1998) Asymptotic Statistics, Cambridge Series in Statistical and Probabilistic Mathematics, vol. 3 (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• [52] Varma SM, Castro F, Maguluri ST (2020) Near optimal control in ride hailing platforms with strategic servers. Preprint, submitted August 9, https://arxiv.org/abs/2008.03762.Google Scholar
• [53] 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
• [54] Wei Y, Xu J, Yu SH (2023) Constant regret primal-dual policy for multi-way dynamic matching. Preprint, submitted February 14, https://doi.org/10.2139/ssrn.4357216.Google Scholar
• [55] Zenios SA (1999) Modeling the transplant waiting list: A queueing model with reneging. Queueing Systems 31:239–251.Crossref, Google Scholar
• [56] Zhang X, Ye ZS, Haskell WB (2024) Error propagation in asymptotic analysis of the data-driven (s,S) inventory policy. Oper. Res. 73(1):1–21.Link, Google Scholar
• [57] Zhong Y, Birge JR, Ward AR (2024) Learning to schedule in multiclass many-server queues with abandonment. Oper. Res. 73(6):3085–3103.Link, Google Scholar
• [58] Zhong Y, Ward AR, Puha AL (2022) Asymptotically optimal idling in the GI/GI/N+ gi queue. Oper. Res. Lett. 50(3):362–369.Crossref, Google Scholar
• [59] Zubeldia M, Jhunjhunwala PR, Maguluri ST (2022) Matching queues with abandonments in quantum switches: Stability and throughput analysis. Oper. Res. 74(1):339–355.Google Scholar