Efficient assignment respecting priorities

DOI10.1016/J.JET.2010.02.007MaRDI QIDQ972883zbMATHOpenAlexFDO

Authors Lars Ehlers, Aytek Erdil

Publication date 21 May 2010

Published in Journal of Economic Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jet.2010.02.007

zbMATH Keywords

consistencyefficiencyassignmentpriorities

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Decision theory (91B06) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Efficient priority rules
• Efficiency and stability under substitutable priorities with ties
• Stable and efficient resource allocation under weak priorities
• Efficient Resource Allocation on the Basis of Priorities
• Efficient mixtures of priority rules for assigning objects

Cites work

• scientific article; zbMATH DE number 48303 (Why is no real title available?)
• College Admissions and the Stability of Marriage
• Consistency in house allocation problems
• Consistency in the probabilistic assignment model
• Consistent house allocation
• Efficient Resource Allocation on the Basis of Priorities
• Efficient priority rules
• Hard variants of stable marriage.
• House allocation with existing tenants
• On cores and indivisibility
• On two competing mechanisms for priority-based allocation problems
• School Choice with Consent^*
• Strategyproof Assignment by Hierarchical Exchange
• Two-sided matching with indifferences

Cited in

(31)

• Optimal priority assignment with hard constraint
• On the equivalence of the Boston and top trading cycles school choice mechanisms
• Strategy-proof tie-breaking in matching with priorities
• Efficient Resource Allocation on the Basis of Priorities
• Resource allocation on the basis of priorities under multi-unit demand
• The ``Boston school-choice mechanism: an axiomatic approach
• Strategy-proofness makes the difference: deferred-acceptance with responsive priorities
• Preference profiles for efficiency, fairness, and consistency in school choice problems
• Nash implementation on the basis of general priorities
• Strategy-proof stochastic assignment
• Complexity of finding Pareto-efficient allocations of highest welfare
• Efficient mixtures of priority rules for assigning objects
• Improving efficiency in school choice under partial priorities
• Nash implementation of constrained efficient stable matchings under weak priorities
• Increasing the representation of a targeted type in a reserve system
• Ex-ante efficiency in assignments with seniority rights
• Welfare theorems for random assignments with priorities
• School choice with preference rank classes
• Responsive affirmative action in school choice
• Efficient priority rules
• Stable and efficient resource allocation under weak priorities
• Efficiency and stability under substitutable priorities with ties
• An analysis of the German university admissions system
• A simple matching domain with indifferences and a master list
• On the efficiency and fairness of deferred acceptance with single tie-breaking
• A market design approach to job rotation
• Efficient resource allocation under multi-unit demand
• Strategy-proof improvements upon deferred acceptance: a maximal domain for possibility
• Respecting priorities versus respecting preferences in school choice: when is there a trade-off?
• Strategy-proof Pareto-improvement
• Acyclic priority profiles in school choice: characterizations

This page was built for publication: Efficient assignment respecting priorities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972883)