Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization

DOI10.1016/j.jmateco.2014.08.003zbMath1308.91095OpenAlexW2091453458MaRDI QIDQ462853

Eun Jeong Heo

Publication date: 22 October 2014

Published in: Journal of Mathematical Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmateco.2014.08.003

zbMATH Keywords

consistencysd-efficiencygeneralized serial rulelimited invariancesd normalized-no-envysd proportional-division lower-bound

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (19)

Favoring Eagerness for Remaining Items: Designing Efficient, Fair, and Strategyproof Mechanisms ⋮ Implementation in stochastic dominance Nash equilibria ⋮ Fair solutions to the random assignment problem ⋮ Constrained random matching ⋮ The object allocation problem with random priorities ⋮ On the consistency of random serial dictatorship ⋮ Multi-unit assignment under dichotomous preferences ⋮ Axiomatic characterizations of the constrained probabilistic serial mechanism ⋮ Strategy-proof and envy-free mechanisms for house allocation ⋮ Multi resource allocation with partial preferences ⋮ A simple characterization of assignment mechanisms on set constraints ⋮ Impossibilities for probabilistic assignment ⋮ A Mathematical Model of Demand-Supply Dynamics with Collectability and Saturation Factors ⋮ A note on object allocation under lexicographic preferences ⋮ A characterization of the extended serial correspondence ⋮ When is the probabilistic serial assignment uniquely efficient and envy-free? ⋮ Upper-contour strategy-proofness in the probabilistic assignment problem ⋮ Extended random assignment mechanisms on a family of good sets ⋮ Submodular optimization views on the random assignment problem

Cites Work

• Probabilistic assignment of objects: characterizing the serial rule
• A characterization of the extended serial correspondence
• House allocation with fractional endowments
• Consistency in the probabilistic assignment model
• Consistency and its converse: an introduction
• Strategy-proof, efficient, and nonbossy quota allocations
• A solution to the random assignment problem on the full preference domain
• The probabilistic serial mechanism with private endowments
• Random assignment of multiple indivisible objects
• On the reduced game property and its converse
• Ordinal efficiency and dominated sets of assignments.
• On characterizations of the probabilistic serial mechanism involving incentive and invariance properties
• On a conjecture by Gale about one-sided matching problems
• Efficient resource allocation under multi-unit demand
• The extended serial correspondence on a rich preference domain
• Straightforwardness of Game Forms with Lotteries as Outcomes
• Two axiomatic approaches to the probabilistic serial mechanism
• A new solution to the random assignment problem.

This page was built for publication: Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization