The object allocation problem with favoring upper ranks

DOI10.1111/IJET.12343MaRDI QIDQ6053622zbMATH OpenOpenAlexFDO

Authors Mehdi Feizi

Publication date 23 October 2023

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

Full work available at URL https://doi.org/10.1111/ijet.12343

zbMATH Keywords

random assignment problemfavoring higher ranksex post favoring ranksfavoring upper ranks

Mathematics Subject Classification ID

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

Recommendations

• Ex-post favoring ranks: a fairness notion for the random assignment problem
• Strategy-proof and envy-free random assignment
• A solution to the random assignment problem on the full preference domain
• A new solution to the random assignment problem.
• Strategy-proof and envy-free mechanisms for house allocation

Cites work

• scientific article; zbMATH DE number 3078983 (Why is no real title available?)
• scientific article; zbMATH DE number 3095897 (Why is no real title available?)
• A new solution to the random assignment problem.
• Approximate random allocation mechanisms
• Ex-post favoring ranks: a fairness notion for the random assignment problem
• Markov Chains as Random Input Automata
• Object allocation via immediate-acceptance: characterizations and an affirmative action application
• On a conjecture by Gale about one-sided matching problems
• Partial strategyproofness: relaxing strategyproofness for the random assignment problem
• Random matching under priorities: stability and no envy concepts
• Stepwise ordinal efficiency for the random assignment problem
• The ``Boston school-choice mechanism: an axiomatic approach
• The object allocation problem with random priorities

This page was built for publication: The object allocation problem with favoring upper ranks

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