Probabilistic assignment of indivisible objects when agents have the same preferences except the ordinal ranking of one object
DOI10.1016/J.MATHSOCSCI.2017.08.001zbMATH Open1415.91174OpenAlexW2751637299MaRDI QIDQ1680102FDOQ1680102
Authors: Hee-In Chang, Youngsub Chun 
Publication date: 22 November 2017
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2017.08.001
Recommendations
- Probabilistic assignment of indivisible goods with single-peaked preferences
- Impossibilities for probabilistic assignment
- Probabilistic assignments of identical indivisible objects and uniform probabilistic rules
- Probabilistic assignment of objects: characterizing the serial rule
- Random assignment of multiple indivisible objects
Individual preferences (91B08) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cites Work
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- A new solution to the random assignment problem.
- A solution to the random assignment problem on the full preference domain
- Random assignment of multiple indivisible objects
- Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms
- Strategy-proof stochastic assignment
- Random Matching Under Dichotomous Preferences
- A simple random assignment problem with a unique solution
- Probabilistic assignment of objects: characterizing the serial rule
- Ordinal efficiency and dominated sets of assignments.
- Two axiomatic approaches to the probabilistic serial mechanism
- Probabilistic assignment of indivisible goods with single-peaked preferences
- Random assignment: redefining the serial rule
- Size versus fairness in the assignment problem
Cited In (13)
- Random assignments of bundles
- Probabilistic assignment of indivisible goods with single-peaked preferences
- Short trading cycles: paired kidney exchange with strict ordinal preferences
- Upper-contour strategy-proofness in the probabilistic assignment problem
- On the tradeoff between efficiency and strategyproofness
- Random assignments with uniform preferences: an impossibility result
- Strategy-proof and envy-free random assignment
- The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching
- Probabilistic assignments of identical indivisible objects and uniform probabilistic rules
- Strategyproof social choice when preferences and outcomes may contain ties
- Random assignments on preference domains with a tier structure
- Impossibilities for probabilistic assignment
- Random assignments on sequentially dichotomous domains
This page was built for publication: Probabilistic assignment of indivisible objects when agents have the same preferences except the ordinal ranking of one object
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1680102)
