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.
Ordinal efficiency and dominated sets of assignments.Journal of Economic Theory, 112(1):157– 172
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.