Equivalence of efficiency notions for ordinal assignment problems

DOI10.1016/j.econlet.2016.07.007zbMath1396.91322OpenAlexW2342592084MaRDI QIDQ1668490

Wonki Jo Cho, Battal Doğan

Publication date: 29 August 2018

Published in: Economics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.econlet.2016.07.007

zbMATH Keywords

ex post efficiency\(dl\)-efficiency\(sd\)-efficiency\(ul\)-efficiencyordinal assignment problem

Mathematics Subject Classification ID

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

Related Items

Probabilistic assignment: an extension approach, The vigilant eating rule: a general approach for probabilistic economic design with constraints, When is the probabilistic serial assignment uniquely efficient and envy-free?, The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strategy-proof stochastic assignment
• Ordinal efficiency and the polyhedral separating hyperplane theorem
• Random assignment: redefining the serial rule
• Ordinal efficiency and dominated sets of assignments.
• A note on object allocation under lexicographic preferences
• Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms
• A new solution to the random assignment problem.
• Incentive properties for ordinal mechanisms