Multi resource allocation with partial preferences

DOI10.1016/j.artint.2022.103824OpenAlexW4309343400MaRDI QIDQ2680798

Sujoy Sikdar, Yongzhi Cao, Xiaoxi Guo, Lirong Xia, Hanpin Wang, Hai-Bin Wang

Publication date: 4 January 2023

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.06836

zbMATH Keywords

computational social choiceprobabilistic serialrandom prioritymulti resource allocationpartial preference

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Uses Software

• CP-nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Assignment problems with complementarities
• The difference indifference makes in strategy-proof allocation of objects
• Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization
• A characterization of the extended serial correspondence
• House allocation with fractional endowments
• Exchange of indivisible goods and indifferences: the top trading absorbing sets mechanisms
• Incentive compatibility in a market with indivisible goods
• Strategy-proof, efficient, and nonbossy quota allocations
• A solution to the random assignment problem on the full preference domain
• Centralized allocation in multiple markets
• Fair assignment of indivisible objects under ordinal preferences
• The probabilistic serial mechanism with private endowments
• Random assignment of multiple indivisible objects
• On characterizations of the probabilistic serial mechanism involving incentive and invariance properties
• Impossibilities for probabilistic assignment
• House allocation with existing tenants
• On cores and indivisibility
• Trade-off between equity and efficiency in a general economy with indivisible goods
• Random assignments of bundles
• Fair division with multiple pieces
• Two-player envy-free multi-cake division
• On a conjecture by Gale about one-sided matching problems
• Strategy-proof allocation of indivisible goods
• A note on object allocation under lexicographic preferences
• Envy-free two-player \(m\)-cake and three-player two-cake divisions
• Coalitional strategy-proof and resource-monotonic solutions for multiple assignment problems
• Learning conditionally lexicographic preference relations
• Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
• Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
• Two axiomatic approaches to the probabilistic serial mechanism
• Efficient Fair Division with Minimal Sharing
• Voting in Combinatorial Domains
• On Houseswapping, the Strict Core, Segmentation, and Linear Programming
• A new solution to the random assignment problem.

This page was built for publication: Multi resource allocation with partial preferences