Impossibilities for probabilistic assignment
From MaRDI portal
Recommendations
- Probabilistic assignment of indivisible objects when agents have the same preferences except the ordinal ranking of one object
- Probabilistic assignments of identical indivisible objects and uniform probabilistic rules
- Strategy-proof and envy-free random assignment
- Probabilistic assignment of indivisible goods with single-peaked preferences
- Probabilistic assignment of objects: characterizing the serial rule
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 characterization of the extended serial correspondence
- A new solution to the random assignment problem.
- A solution to the random assignment problem on the full preference domain
- Algorithms and Computation
- Assignment Problem Based on Ordinal Preferences
- Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms
- Consistency in the probabilistic assignment model
- Efficiency and strategy-proofness in object assignment problems with multi-demand preferences
- Fair division under ordinal preferences: computing envy-free allocations of indivisible goods
- House allocation with existing tenants
- House allocation with fractional endowments
- Incentive properties for ordinal mechanisms
- Incentives in the probabilistic serial mechanism
- On a conjecture by Gale about one-sided matching problems
- On popular random assignments
- Probabilistic assignment of indivisible goods with single-peaked preferences
- Probabilistic assignment of objects: characterizing the serial rule
- Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization
- Probabilistic assignments of identical indivisible objects and uniform probabilistic rules
- Queue allocation of indivisible goods
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- Random assignment of multiple indivisible objects
- Random assignment under weak preferences
- Strategy-proof allocation of indivisible goods
- Strategy-proof, efficient, and nonbossy quota allocations
- The probabilistic serial mechanism with private endowments
- Two axiomatic approaches to the probabilistic serial mechanism
Cited in
(19)- Probabilistic assignment: an extension approach
- On existence of truthful fair cake cutting mechanisms
- Fair solutions to the random assignment problem
- Impossibility results for choice correspondences
- An étude in modeling the definability of equilibrium
- Upper-contour strategy-proofness in the probabilistic assignment problem
- A new impossibility result for random assignments
- When are efficient and fair assignment mechanisms group strategy-proof?
- Notions of anonymity for object assignment: impossibility theorems
- Probabilistic assignment of indivisible objects when agents have the same preferences except the ordinal ranking of one object
- Consistency in the probabilistic assignment model
- Probabilistic assignments of identical indivisible objects and uniform probabilistic rules
- scientific article; zbMATH DE number 3057871 (Why is no real title available?)
- An impossibility theorem for allocation aggregation
- Evaluating assignment without transfers: a market perspective
- Strategy-proof and envy-free random assignment
- Multi resource allocation with partial preferences
- Efficient and fair assignment mechanisms are strongly group manipulable
- Group strategy-proof probabilistic voting with single-peaked preferences
This page was built for publication: Impossibilities for probabilistic assignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1697833)
