A simple characterization of assignment mechanisms on set constraints
From MaRDI portal
Recommendations
- Extended random assignment mechanisms on a family of good sets
- Two axiomatic approaches to the probabilistic serial mechanism
- On characterizations of the probabilistic serial mechanism involving incentive and invariance properties
- Submodular optimization views on the random assignment problem
- A solution to the random assignment problem on the full preference domain
Cites work
- A characterization of the extended serial correspondence
- A new ex-ante efficiency criterion and implications for the probabilistic serial mechanism
- A new solution to the random assignment problem.
- Constrained random matching
- Extended random assignment mechanisms on a family of good sets
- Probabilistic assignment of objects: characterizing the serial rule
- Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization
- Random assignment: redefining the serial rule
- Random assignments of bundles
- Submodular functions and optimization.
- Submodular optimization views on the random assignment problem
- Two axiomatic approaches to the probabilistic serial mechanism
Cited in
(5)- Extended random assignment mechanisms on a family of good sets
- Submodular optimization views on the random assignment problem
- Axiomatic characterizations of the constrained probabilistic serial mechanism
- Simultaneous eating algorithm and greedy algorithm in assignment problems
- Ex ante and ex post envy-freeness on polytope resources
This page was built for publication: A simple characterization of assignment mechanisms on set constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155636)
