Establishes complexity results for stable matchings with submodular preferences and packing constraints, then constructs approximately stable matchings via a framework that reduces the problem to online packing algorithms.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Approximately Stable Matchings with General Constraints
Establishes complexity results for stable matchings with submodular preferences and packing constraints, then constructs approximately stable matchings via a framework that reduces the problem to online packing algorithms.