A simple characterization of assignment mechanisms on set constraints

DOI10.1007/s43069-023-00195-7zbMath1515.91088MaRDI QIDQ6155636

Ping Zhan

Publication date: 5 June 2023

Published in: SN Operations Research Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s43069-023-00195-7

zbMATH Keywords

probabilistic serial; submodular functions; non-wastefulness; ordinal fairness

Mathematics Subject Classification ID

91B32: Resource and cost allocation (including fair division, apportionment, etc.)

Related Items

Simultaneous eating algorithm and greedy algorithm in assignment problems

Cites Work

• Probabilistic assignment of objects: characterizing the serial rule
• Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization
• A characterization of the extended serial correspondence
• Random assignment: redefining the serial rule
• A new ex-ante efficiency criterion and implications for the probabilistic serial mechanism
• Random assignments of bundles
• Constrained random matching
• Extended random assignment mechanisms on a family of good sets
• Submodular optimization views on the random assignment problem
• Submodular functions and optimization.
• Two axiomatic approaches to the probabilistic serial mechanism
• A new solution to the random assignment problem.