A general polynomial-time framework finds stable matchings that minimize utilitarian or egalitarian objectives for any polynomial-time computable set functions by reducing them to linear edge weights.
Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Maximally Diverse Stable Matchings: Optimizing Arbitrary Institutional Objectives
A general polynomial-time framework finds stable matchings that minimize utilitarian or egalitarian objectives for any polynomial-time computable set functions by reducing them to linear edge weights.