Allocation of indivisible items with individual preference graphs

DOI10.1016/J.DAM.2023.02.010MaRDI QIDQ6157417zbMATH OpenOpenAlexFDO

Authors Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanič, Peter Mursic, Ulrich Pferschy, Nevena Pivač

Publication date 11 May 2023

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.dam.2023.02.010

zbMATH Keywords

partial orderfair divisionpreference graphdissatisfaction

Mathematics Subject Classification ID

Applications of graph theory (05C90) Individual preferences (91B08) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Fair division under ordinal preferences: computing envy-free allocations of indivisible goods
• On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences
• Fair assignment of indivisible objects under ordinal preferences
• Computing a small agreeable set of indivisible items
• Possible and necessary allocations under serial dictatorship with incomplete preference lists

Cites work

• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• A combinatorial algorithm for weighted stable sets in bipartite graphs
• A simple procedure for finding equitable allocations of indivisible goods
• Allocating indivisible items with minimum dissatisfaction on preference graphs
• Clustering to minimize the maximum intercluster distance
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Easy problems for tree-decomposable graphs
• Fair Allocation of Indivisible Goods
• Fair assignment of indivisible objects under ordinal preferences
• Graph minors. III. Planar tree-width
• Introduction to the theory of fair allocation
• Maximizing Nash product social welfare in allocating indivisible goods
• Multiple criteria decision analysis. State of the art surveys. In 2 volumes
• Parameterized algorithms
• Preference–Approval Structures in Group Decision Making: Axiomatic Distance and Aggregation
• Solution methods and computational investigations for the linear bottleneck assignment problem
• The Santa Claus problem
• The complexity of theorem-proving procedures
• Two-person fair division of indivisible items: an efficient envy-free algorithm
• Voting systems that combine approval and preference

Cited in

(6)

• Probabilistic assignment of indivisible goods with single-peaked preferences
• Satisfying neighbor preferences on a circle
• Fair allocation algorithms for indivisible items under structured conflict constraints
• Parameterized complexity of manipulating sequential allocation
• Allocating indivisible items with minimum dissatisfaction on preference graphs
• On reachable assignments in cycles

This page was built for publication: Allocation of indivisible items with individual preference graphs

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