Algorithms for Pareto optimal exchange with bounded exchange cycles

DOI10.1016/j.orl.2019.06.002zbMath1476.91071OpenAlexW2951487233WikidataQ127670574 ScholiaQ127670574MaRDI QIDQ2294333

Haris Aziz

Publication date: 10 February 2020

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2019.06.002

zbMATH Keywords

Pareto optimalityindividual rationalitystrategyproofnesskidney exchangehousing markets

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (1)

On the convergence of swap dynamics to Pareto-optimal matchings

Cites Work

• The difference indifference makes in strategy-proof allocation of objects
• Transplant quality and patients' preferences in paired kidney exchange
• Pairwise kidney exchange
• Strategy-proofness and the strict core in a market with indivisibilities
• On cores and indivisibility
• Algorithms and Computation

This page was built for publication: Algorithms for Pareto optimal exchange with bounded exchange cycles