Multi resource allocation with partial preferences

DOI10.1016/J.ARTINT.2022.103824MaRDI QIDQ2680798zbMATH OpenOpenAlexFDO

Authors Sujoy Sikdar, Xiaoxi Guo, Lirong Xia, Yongzhi Cao, 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 choicemulti resource allocationpartial preferenceprobabilistic serialrandom priority

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Cites work

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

Cited in

(2)

• Allocation of flexible and indivisible resources with decision postponement and demand learning
• MULTI-CLASS RESOURCE SHARING WITH PREEMPTIVE PRIORITIES

Describes a project that uses

Uses Software

• CP-nets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2680798)