Extended random assignment mechanisms on a family of good sets

DOI10.1007/s43069-021-00095-8zbMath1475.91126OpenAlexW3207236274MaRDI QIDQ2241324

Yoshio Sano, Ping Zhan

Publication date: 8 November 2021

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

Full work available at URL: https://doi.org/10.1007/s43069-021-00095-8

zbMATH Keywords

polymatroidsordinal preferenceprobabilistic serial mechanismsubmodular optimizationintegral decompositionindependent flows

Mathematics Subject Classification ID

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

Related Items (2)

A simple characterization of assignment mechanisms on set constraints ⋮ Simultaneous eating algorithm and greedy algorithm in assignment problems

Cites Work

• Unnamed Item
• Unnamed Item
• Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization
• A solution to the random assignment problem on the full preference domain
• Random assignment: redefining the serial rule
• The generalized random priority mechanism with budgets
• Probabilistic assignment: an extension approach
• A new ex-ante efficiency criterion and implications for the probabilistic serial mechanism
• Egalitarianism under earmark constraints
• A variation of DS decomposition in set function optimization
• A simple construction of complete single-peaked domains by recursive tiling
• Dominance of truthtelling and the lattice structure of Nash equilibria
• Submodular optimization views on the random assignment problem
• Matching with partners and projects
• Cores of convex games
• Submodular functions and optimization.
• A Concept of Egalitarianism Under Participation Constraints
• Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
• Optimal flows in networks with multiple sources and sinks
• ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS
• Two axiomatic approaches to the probabilistic serial mechanism
• One-dimensional mechanism design
• Random Matching Under Dichotomous Preferences
• Combinatorial optimization. Theory and algorithms
• A new solution to the random assignment problem.
• Entropy, desegregation, and proportional rationing

This page was built for publication: Extended random assignment mechanisms on a family of good sets