A linear-program-guided greedy policy provably achieves the optimal competitive ratio 1/2 against an omniscient benchmark in dynamic matching with homogeneous abandonment rates.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Greedy Dynamic Matching
A linear-program-guided greedy policy provably achieves the optimal competitive ratio 1/2 against an omniscient benchmark in dynamic matching with homogeneous abandonment rates.