H. K. Abadi and B. Prabhakar, Stable Matchings in Metric Spaces: Modeling Real-World Preferences using Proximity, 2017.

I. J. Adan, J. S. Van-leeuwaarden, and E. M. Winands, On the application of Rouché's theorem in queueing theory, Operations Research Letters, vol.34, issue.3, pp.355-360, 2006.

P. K. Agarwal, A. Efrat, and M. Sharir, Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications, Proceedings of the eleventh annual symposium on Computational geometry - SCG '95, 1995.

R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows, Network Flows: Theory, Algorithms, and Applications, 1988.

L. Atzori, A. Iera, and G. Morabito, The Internet of Things: A survey, Computer Networks, vol.54, issue.15, pp.2787-2805, 2010.

N. T. Bailey, On Queueing Processes with Bulk Service, Journal of the Royal Statistical Society: Series B (Methodological), vol.16, issue.1, pp.80-87, 1954.

J. Bukac, Matching On a Line, 2018.

S. Doshi, S. Bhandare, and T. X. Brown, An on-demand minimum energy routing protocol for a wireless ad hoc network, ACM SIGMOBILE Mobile Computing and Communications Review, vol.6, issue.3, pp.50-66, 2002.

D. Gale and L. S. Shapley, College Admissions and the Stability of Marriage, The American Mathematical Monthly, vol.69, issue.1, p.9, 1962.

V. Goswami and P. Vijaya-laxmi, Performance Analysis of a Renewal Input Bulk Service Queue with Accessible and Non-Accessible Batches, Quality Technology & Quantitative Management, vol.8, issue.2, pp.87-100, 2011.

I. W. Ho, K. K. Leung, and J. W. Polak, Stochastic Model and Connectivity Dynamics for VANETs in Signalized Road Systems, IEEE/ACM Transactions on Networking, vol.19, issue.1, pp.195-208, 2011.

A. E. Holroyd, R. Pemantle, Y. Peres, and O. Schramm, Poisson matching, Annales de l'Institut Henri Poincaré, Probabilités et Statistiques, vol.45, issue.1, pp.266-287, 2009.

F. Kingman, The effect of queue discipline on waiting time variance, Mathematical Proceedings of the Cambridge Philosophical Society, vol.58, issue.1, pp.163-164, 1962.

K. K. Leung, W. A. Massey, and W. Whitt, Traffic models for wireless communication networks, IEEE Journal on Selected Areas in Communications, vol.12, issue.8, pp.1353-1364, 1994.

M. Mézard and G. Parisi, The Euclidean matching problem, Journal de Physique, vol.49, issue.12, pp.2019-2025, 1988.

R. Nelson and A. N. Tantawi, Approximate analysis of fork/join synchronization in parallel queues, IEEE Transactions on Computers, vol.37, issue.6, pp.739-743, 1988.

J. Orlin, A polynomial time primal network simplex algorithm for minimum cost flows, Mathematical Programming, vol.78, issue.2, pp.109-129, 1997.

E. M. Reingold and R. E. Tarjan, On a Greedy Heuristic for Complete Matching, SIAM Journal on Computing, vol.10, issue.4, pp.676-681, 1981.

S. T. Roweis and L. K. Saul, Nonlinear Dimensionality Reduction by Locally Linear Embedding, Science, vol.290, issue.5500, pp.2323-2326, 2000.

J. F. Shortle, J. M. Thompson, D. Gross, and C. M. Harris, Fundamentals of Queueing Theory, Fundamentals of Queueing Theory. Fifth Edition, Wiley Series in Probability and Statistics, 2018.

E. Stuart, Matching Methods for Causal Inference: A Review and a Look Forward, Statistical Science, vol.25, issue.1, pp.1-21, 2010.

P. Welch, On a GeneralizedM/G/1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional Service, Operations Research, vol.12, issue.5, pp.736-752, 1964.