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.
Theoretical Computer Science 931 (2022), 1–16
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 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.