Random assignments with uniform preferences: an impossibility result

DOI10.1016/J.ORL.2023.03.011MaRDI QIDQ6106541zbMATH OpenOpenAlexFDO

Authors Homa Hosseinzadeh Ranjbar, Mehdi Feizi

Publication date 3 July 2023

Published in Operations Research Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.orl.2023.03.011

zbMATH Keywords

equal division lower boundimpossibility resultrandom assignment problemuniform preferences

Mathematics Subject Classification ID

Matching models (91B68)

Recommendations

• A note on the assignment problem with uniform preferences
• A new impossibility result for random assignments
• 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 random assignment

Cites work

• A new solution to the random assignment problem.
• A note on the assignment problem with uniform preferences
• A simple random assignment problem with a unique solution
• A solution to the random assignment problem on the full preference domain
• Fairness and efficiency in strategy-proof object allocation mechanisms
• Incompatibility of efficiency and strategyproofness in the random assignment setting with indifferences
• Partial strategyproofness: relaxing strategyproofness for the random assignment problem
• Probabilistic assignment of indivisible objects when agents have the same preferences except the ordinal ranking of one object
• Random assignment under weak preferences
• Robust ex-post Pareto efficiency and fairness in random assignments: two impossibility results
• Strategy-proof assignment on the full preference domain
• Upper-contour strategy-proofness in the probabilistic assignment problem

Cited in

(5)

• Random assignment under weak preferences
• Random assignments on preference domains with a tier structure
• Randomization with non-uniform allocations: fulfillment time distributions and bias properties
• Game-theoretically secure protocols for the ordinal random assignment problem
• Note on Gale's conjecture in one-sided matching problems

This page was built for publication: Random assignments with uniform preferences: an impossibility result

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