Perfect sampling of stochastic matching models with reneging

DOI10.1017/APR.2023.62MaRDI QIDQ7022540zbMATH OpenFDO

Authors Thomas Masanet, Pascal Moyal

Publication date 25 February 2025

Published in Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/APR.2023.62

zbMATH Keywords

coupling from the pastMarkov chainsstochastic matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Computational methods in Markov chains (60J22) Numerical analysis or methods applied to Markov chains (65C40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites work

• A correction and some additional remarks on: Stationary solutions of stochastic recursions describing discrete event systems
• A general stochastic matching model on multigraphs
• A generalized backward scheme for solving nonmonotonic stochastic recursions
• A method for solving a class of recursive stochastic equations
• A product form for the general stochastic matching model
• A stochastic matching model on hypergraphs
• Exact FCFS matching rates for two infinite multitype sequences
• Exact Sampling from a Continuous State Space
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• Fcfs infinite bipartite matching of servers and customers
• Generalized Max-Weight Policies in Stochastic Matching
• Geometric ergodicity and perfect simulation
• How to couple from the past using a read-once source of randomness
• scientific article; zbMATH DE number 1188967 (Why is no real title available?)
• scientific article; zbMATH DE number 1193442 (Why is no real title available?)
• scientific article; zbMATH DE number 1460450 (Why is no real title available?)
• scientific article; zbMATH DE number 1522706 (Why is no real title available?)
• scientific article; zbMATH DE number 1416816 (Why is no real title available?)
• Loss networks
• Matching queues with reneging: a product form solution
• On queues with impatience: stability, and the optimality of earliest deadline first
• On the instability of matching queues
• Perfect sampling for infinite server and loss systems
• Perfect sampling of GI/GI/\(c\) queues
• Perfect sampling using bounding chains.
• Perfect simulation
• Perfect simulation and backward coupling^∗
• Perfect simulation for a class of positive recurrent Markov chains
• Perfect simulation using dominating processes on ordered spaces, with application to locally stable point processes
• Reversibility and further properties of FCFS infinite bipartite matching
• Reward maximization in general dynamic matching systems
• Stability of a Processor-Sharing Queue with Varying Throughput
• Stability of the bipartite matching model
• Stability of the stochastic matching model
• Stability regions of systems with compatibilities and ubiquitous measures on graphs
• Stochastic modeling and analysis of telecoms networks
• Stochastic non-bipartite matching models and order-independent loss queues
• Two ergodicity criteria for stochastically recursive sequences

Cited in

(1)

• Toward organ shortage resilient allocation policies using real-time queueing models for liver transplantation

This page was built for publication: Perfect sampling of stochastic matching models with reneging

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7022540)