Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization
From MaRDI portal
(Redirected from Publication:462853)
Recommendations
- Generalized sequential stochastic assignment problem
- The stochastic generalised assignment problem with Bernoulli demands
- Probabilistic analysis of the generalised assignment problem
- Extensions of the sequential stochastic assignment problem
- Publication:4726045
- Asymptotic analysis for multi-objective sequential stochastic assignment problems
- A Probabilistic Approach to Solving Assignment Problems
- A probabilistic feasibility and value analysis of the generalized assignment problem
- Sequential location-allocation problems on chains and trees with probabilistic link demands
- Doubly stochastic sequential assignment problem
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
- Consistency and its converse: an introduction
- Consistency in the probabilistic assignment model
- Efficient resource allocation under multi-unit demand
- House allocation with fractional endowments
- On a conjecture by Gale about one-sided matching problems
- On characterizations of the probabilistic serial mechanism involving incentive and invariance properties
- On the reduced game property and its converse
- Ordinal efficiency and dominated sets of assignments.
- Probabilistic assignment of objects: characterizing the serial rule
- Random assignment of multiple indivisible objects
- Straightforwardness of Game Forms with Lotteries as Outcomes
- Strategy-proof, efficient, and nonbossy quota allocations
- The extended serial correspondence on a rich preference domain
- The probabilistic serial mechanism with private endowments
- Two axiomatic approaches to the probabilistic serial mechanism
Cited in
(24)- Favoring Eagerness for Remaining Items: Designing Efficient, Fair, and Strategyproof Mechanisms
- Implementation in stochastic dominance Nash equilibria
- Strategy-proof and envy-free mechanisms for house allocation
- A simple characterization of assignment mechanisms on set constraints
- Fair solutions to the random assignment problem
- A characterization of the extended serial correspondence
- Axiomatic characterizations of the constrained probabilistic serial mechanism
- A mathematical model of demand-supply dynamics with collectability and saturation factors
- Upper-contour strategy-proofness in the probabilistic assignment problem
- The object allocation problem with random priorities
- Constrained random matching
- Submodular optimization views on the random assignment problem
- A note on object allocation under lexicographic preferences
- Multi-unit assignment under dichotomous preferences
- Impossibilities for probabilistic assignment
- Consistency in the probabilistic assignment model
- Extended random assignment mechanisms on a family of good sets
- Efficient rules for probabilistic assignment
- When is the probabilistic serial assignment uniquely efficient and envy-free?
- On characterizations of the probabilistic serial mechanism involving incentive and invariance properties
- Probabilistic assignment of objects: characterizing the serial rule
- Multi resource allocation with partial preferences
- A theory of fair random allocation under priorities
- On the consistency of random serial dictatorship
This page was built for publication: Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q462853)
