Random assignment: redefining the serial rule
From MaRDI portal
(Redirected from Publication:896952)
Recommendations
Cites work
- 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
- Allocation of divisible goods under lexicographic preferences
- Probabilistic assignment of objects: characterizing the serial rule
- Random Matching Under Dichotomous Preferences
- Two axiomatic approaches to the probabilistic serial mechanism
Cited in
(27)- Random assignments on sequentially dichotomous domains
- Random assignments of bundles
- On slots' scheduling
- Equivalence of efficiency notions for ordinal assignment problems
- A marriage matching mechanism menagerie
- Corrigendum to: ``Random assignment: redefining the serial rule
- Guaranteed size ratio of ordinally efficient and envy-free mechanisms in the assignment problem
- A note on object allocation under lexicographic preferences
- A simple characterization of assignment mechanisms on set constraints
- Extended random assignment mechanisms on a family of good sets
- Submodular optimization views on the random assignment problem
- Probabilistic assignment of objects: characterizing the serial rule
- Probabilistic assignment: an extension approach
- Probabilistic assignment of indivisible objects when agents have the same preferences except the ordinal ranking of one object
- A characterization of the extended serial correspondence
- Constrained random matching
- On the consistency of random serial dictatorship
- Efficient rules for probabilistic assignment
- Random serial dictatorship and ordinally efficient contracts
- The vigilant eating rule: a general approach for probabilistic economic design with constraints
- Strategy-proof and envy-free random assignment
- When is the probabilistic serial assignment uniquely efficient and envy-free?
- Random assignments on preference domains with a tier structure
- Characterizing a probabilistic version of the Boston mechanism under weak priorities
- Size versus fairness in the assignment problem
- Incentive properties for ordinal mechanisms
- The fractional Boston random assignment rule and its axiomatic characterization
This page was built for publication: Random assignment: redefining the serial rule
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896952)
