REVIEW 1 cited by
On the sub-additivity of stochastic matching
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We consider a stochastic matching model with a general compatibility graph, as introduced in \cite{MaiMoy16}. We prove that most common matching policies (including FCFM, priorities and random) satisfy a particular sub-additive property, which we exploit to show in many cases, the coupling-from-the-past to the steady state, using a backwards scheme {\em \`a la} Loynes. We then use these results to explicitly construct perfect bi-infinite matchings, and to build a perfect simulation algorithm in the case where the buffer of the system is finite.
Forward citations
Cited by 1 Pith paper
-
Adaptive Approximation Schemes for Matching Queues
Adaptive queue-length-based matching policies can be approximated to within (1 minus epsilon) in polynomial time for constant-size networks and for fixed-dimensional Euclidean networks with abandonment.
Discussion (0). Continue with ORCID to comment.