Allocating indivisible items with minimum dissatisfaction on preference graphs

DOI10.1007/978-3-030-87756-9_16OpenAlexW3208474667MaRDI QIDQ2695444

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

Publication date: 31 March 2023

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

zbMATH Keywords

partial orderfair divisionpreference graph

Mathematics Subject Classification ID

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

Related Items (1)

Allocation of indivisible items with individual preference graphs

Cites Work

• Multiple criteria decision analysis. State of the art surveys. In 2 volumes
• Maximizing Nash product social welfare in allocating indivisible goods
• Fair assignment of indivisible objects under ordinal preferences
• Clustering to minimize the maximum intercluster distance
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Fair sharing under dichotomous preferences
• A simple procedure for finding equitable allocations of indivisible goods
• Fair division with binary valuations: one rule to rule them all
• Two-Person Fair Division of Indivisible Items: An Efficient, Envy-Free Algorithm
• The Santa Claus problem
• The NP-Completeness of Edge-Coloring
• Fair Packing of Independent Sets
• Introduction to the Theory of Fair Allocation
• Parameterized Algorithms

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