Allocating indivisible items with minimum dissatisfaction on preference graphs

DOI10.1007/978-3-030-87756-9_16MaRDI QIDQ2695444zbMATH OpenOpenAlexFDO

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

Publication date 31 March 2023

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

zbMATH Keywords

fair divisionpartial orderpreference graph

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Decision theory (91B06) Social choice (91B14) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Matching models (91B68)

Recommendations

• Allocation of indivisible items with individual preference graphs
• Fair assignment of indivisible objects under ordinal preferences
• Fair allocation algorithms for indivisible items under structured conflict constraints
• Fair division under ordinal preferences: computing envy-free allocations of indivisible goods
• Computing a small agreeable set of indivisible items

Cites work

• A simple procedure for finding equitable allocations of indivisible goods
• Clustering to minimize the maximum intercluster distance
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Fair assignment of indivisible objects under ordinal preferences
• Fair division with binary valuations: one rule to rule them all
• Fair Packing of Independent Sets
• Fair sharing under dichotomous preferences
• 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
• The NP-Completeness of Edge-Coloring
• The Santa Claus problem
• Two-person fair division of indivisible items: an efficient envy-free algorithm

Cited in

(3)

• On reachable assignments in cycles
• Allocation of indivisible items with individual preference graphs
• Minimizing maximum dissatisfaction in the allocation of indivisible items under a common preference graph

This page was built for publication: Allocating indivisible items with minimum dissatisfaction on preference graphs

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