Generalized Max-Weight Policies in Stochastic Matching

References

• 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, Busic A, Mairesse J, Weiss G (2017) Reversibility and further properties of FCFS infinite bipartite matching. Math. Oper. Res. 43(2):598–621.Link, Google Scholar
• Adan I, Kleiner I, Righter R, Weiss G (2018) FCFS parallel service systems and matching models. Performance Evaluation 127–128:253–272.Google Scholar
• Boxma OJ, David I, Perry D, Stadje W (2011) A new look at organ transplantation models and double matching queues. Probability Engrg. Inform. Sci. 25(2):135–155.Google Scholar
• Büke B, Chen H (2015) Stabilizing policies for probabilistic matching systems. Queueing Systems 80(1–2):35–69.Google Scholar
• Büke B, Chen H (2017) Fluid and diffusion approximations of probabilistic matching systems. Queueing Systems 86(1–2):1–33.Google Scholar
• Bušić A, Meyn S (2016) Approximate optimality with bounded regret in dynamic matching models. Preprint, submitted June 25, https://arxiv.org/abs/1411.1044.Google Scholar
• Bušić A, Gupta V, Mairesse J (2013) Stability of the bipartite matching model. Adv. Appl. Probability 45(2):351–378.Google Scholar
• Caldentey R, Kaplan E, Weiss G (2009) FCFS infinite bipartite matching of servers and customers. Adv. Appl. Probability 41(3):695–730.Google Scholar
• Gurvich I, Ward A (2014) On the dynamic control of matching queues. Stochastic Systems 4(2):479–523.Link, Google Scholar
• Hairer M (2014) Convergence of Markov Processes. Lecture Notes available in the web-page of the author, https://www.hairer.org/notes/Convergence.pdf.Google Scholar
• Lu Y, Xie Q, Kliot G, Geller A, Larus JR, Greenberg A (2011) Join-Idle-Queue: A novel load balancing algorithm for dynamically scalable web services. Performance Evaluation 68(11):1056–1071.Google Scholar
• Mairesse J, Moyal P (2016) Stability of the stochastic matching model. J. Appl. Probability 53(4):1064–1077.Google Scholar
• Meyn SP, Tweedie RL (1993) Stability of Markovian processes. III. Foster-Lyapunov criteria for continuous-time processes. Adv. Appl. Probability 3(25):518–548.Google Scholar
• Mitzenmacher M (1996) The power of two choices in randomized load balancing. PhD thesis, University of California, Berkeley, CA.Google Scholar
• Moyal P, Perry O (2017) On the instability of matching queues. Ann. Appl. Probability 27(6):3385–3434.Google Scholar
• Moyal P, Perry O (2021) Stability of parallel server systems. Oper. Res., ePub ahead of print August 16, https://doi.org/10.1287/opre.2021.2125.Google Scholar
• Moyal P, Busic A, Mairesse J (2018) Loynes construction for the extended bipartite matching. Preprint, submitted March 7, https://arxiv.org/abs/1803.02788.Google Scholar
• Moyal P, Busic A, Mairesse J (2020) A product form for the general stochastic matching model. Preprint, submitted February 5, https://arxiv.org/abs/1711.02620.Google Scholar
• Nazari M, Stolyar AL (2019) A stochastic matching model on hypergraphs. Queueing Systems 91(1–2):143–170.Google Scholar
• Rahmé Y, Moyal P (2019) Reward maximization in general dynamic matching systems. Preprint, submitted July 30, https://arxiv.org/abs/1907.12711.Google Scholar
• Tassiulas L, Ephremides A (1992) Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Automated Control 37(12):1936–1948.Google Scholar