ITEA enumerates the complete set of Pareto-optimal allocations for one-sided matching, with proofs of soundness and completeness and better runtime than brute force when few PO allocations exist.
Counting houses of pareto optimal matchings in the house allocation problem.Discrete Math- ematics, 339(12):2919–2932
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
-
Finding Pareto frontier for one-sided matching
ITEA enumerates the complete set of Pareto-optimal allocations for one-sided matching, with proofs of soundness and completeness and better runtime than brute force when few PO allocations exist.