For Stable Hypergraph Matching, College Admission with Common Quotas, and Stable Multicommodity Flow, a stable matching always exists after perturbing capacities by at most ℓ-1, 2ℓ-1, or k-1, respectively.
Algorithms 6 (03 2013), 161–168
1 Pith paper cite this work, alongside 11 external citations. Polarity classification is still indexing.
1
Pith paper citing it
11
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Near-Feasible Solutions to Complex Stable Matching Problems
For Stable Hypergraph Matching, College Admission with Common Quotas, and Stable Multicommodity Flow, a stable matching always exists after perturbing capacities by at most ℓ-1, 2ℓ-1, or k-1, respectively.