A note on the assignment problem with uniform preferences

DOI10.1016/j.orl.2015.02.010zbMath1408.90139arXiv1412.6078OpenAlexW2070286373MaRDI QIDQ1785360

Jay Sethuraman, Chun Ye

Publication date: 28 September 2018

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

Full work available at URL: https://arxiv.org/abs/1412.6078

zbMATH Keywords

fairnessefficiencyprobabilistic serial mechanismrandom assignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Related Items (2)

Random assignments with uniform preferences: an impossibility result ⋮ Uncertain random assignment problem

Cites Work

• Unnamed Item
• A simple random assignment problem with a unique solution
• Consistency in the probabilistic assignment model
• Incentive compatibility in a market with indivisible goods
• Pairwise kidney exchange
• A solution to the random assignment problem on the full preference domain
• Queue allocation of indivisible goods
• On a conjecture by Gale about one-sided matching problems
• Scheduling with Opting Out: Improving upon Random Priority
• Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
• A new solution to the random assignment problem.

This page was built for publication: A note on the assignment problem with uniform preferences