Simultaneous eating algorithm and greedy algorithm in assignment problems

DOI10.1007/s10878-023-01063-0zbMath1522.90171OpenAlexW4384565096MaRDI QIDQ6176397

Ping Zhan

Publication date: 22 August 2023

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-023-01063-0

zbMATH Keywords

ordinal preferencepolymatroidordinal efficiencysubmodular function optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Individual preferences (91B08) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• Unnamed Item
• Unnamed Item
• Ordinal efficiency and the polyhedral separating hyperplane theorem
• A solution to the random assignment problem on the full preference domain
• A constructive proof of the ordinal efficiency welfare theorem
• Ordinal efficiency and dominated sets of assignments.
• Constrained random matching
• Sufficient conditions for the optimality of the greedy algorithm in greedoids
• Extended random assignment mechanisms on a family of good sets
• Submodular optimization views on the random assignment problem
• Efficient rules for probabilistic assignment
• Submodular functions and optimization.
• The vigilant eating rule: a general approach for probabilistic economic design with constraints
• Two axiomatic approaches to the probabilistic serial mechanism
• How to Divide When There Isn't Enough
• Convex Analysis
• A new solution to the random assignment problem.
• A simple characterization of assignment mechanisms on set constraints

This page was built for publication: Simultaneous eating algorithm and greedy algorithm in assignment problems