A note on object allocation under lexicographic preferences

DOI10.1016/j.jmateco.2013.12.002zbMath1284.91288OpenAlexW2067487822MaRDI QIDQ2441234

Daniela Saban, Jay Sethuraman

Publication date: 24 March 2014

Published in: Journal of Mathematical Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmateco.2013.12.002

zbMATH Keywords

efficiencystrategy-proofnesslexicographic preferencesenvy-freenessobject allocation

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (10)

Probabilistic assignment: an extension approach ⋮ Pareto optimal matchings of students to courses in the presence of prerequisites ⋮ Equivalence of efficiency notions for ordinal assignment problems ⋮ Pareto optimal matchings with lower quotas ⋮ Multi resource allocation with partial preferences ⋮ When is the probabilistic serial assignment uniquely efficient and envy-free? ⋮ A modified deferred acceptance algorithm for conditionally lexicographic-substitutable preferences ⋮ Incentive properties for ordinal mechanisms ⋮ The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching ⋮ Submodular optimization views on the random assignment problem

Cites Work

• Unnamed Item
• Unnamed Item
• Probabilistic assignment of objects: characterizing the serial rule
• Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization
• A solution to the random assignment problem on the full preference domain
• Random assignment: redefining the serial rule
• House allocation with existing tenants: a characterization
• A new solution to the random assignment problem.

This page was built for publication: A note on object allocation under lexicographic preferences