Evaluates Pareto-optimal allocations in allocation problems, suggesting new computational methods.
Pareto-optimality plays a central role in evaluating the efficiency of solutions to allocation problems, such as house allocation, school choice, and kidney exchange. We introduce a general linear programming problem subject to Pareto-optimality conditions, which we call Max-Pareto. Using the novel result that Pareto-optimal bipartite matchings are fractionally Pareto-optimal, we prove that Max-Pareto is NP-complete. We propose a bilinear programming formulation of Max-Pareto, and evaluate its computational performance on the problem of finding Pareto-optimal allocations of highest welfare.
No takes yet. Share an insight, caveat, or question.
0000-0002-8234-5373 et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: