Algorithms and Computation

DOI10.1007/11602613zbMath1115.90049OpenAlexW2304246803MaRDI QIDQ5897947

David F. Manlove, David J. Abraham, Kurt Mehlhorn, Katarína Cechlárova

Publication date: 14 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11602613

Mathematics Subject Classification ID

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

Related Items (max. 100)

Unnamed Item ⋮ Unnamed Item ⋮ The dynamics of rank-maximal and popular matchings ⋮ Fair assignment of indivisible objects under ordinal preferences ⋮ Impossibilities for probabilistic assignment ⋮ On reachable assignments in cycles ⋮ Pareto optimality in coalition formation ⋮ Reducing rank-maximal to maximum weight matching ⋮ Mobile Sensor Networks ⋮ Efficient reallocation under additive and responsive preferences ⋮ Incompatibility of efficiency and strategyproofness in the random assignment setting with indifferences ⋮ Complexity of finding Pareto-efficient allocations of highest welfare ⋮ Counting houses of Pareto optimal matchings in the house allocation problem ⋮ Algorithms for Pareto optimal exchange with bounded exchange cycles ⋮ Preference Inference Based on Pareto Models

This page was built for publication: Algorithms and Computation