Allocation of indivisible items with individual preference graphs
From MaRDI portal
Publication:6157417
DOI10.1016/j.dam.2023.02.010zbMath1514.91069OpenAlexW4327694573MaRDI QIDQ6157417
Nina Chiarelli, Peter Mursic, Martin Milanič, Ulrich Pferschy, Stefan Lendl, Nevena Pivač, Clément Dallard, Andreas Darmann
Publication date: 11 May 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.02.010
Applications of graph theory (05C90) Individual preferences (91B08) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cites Work
- Unnamed Item
- Multiple criteria decision analysis. State of the art surveys. In 2 volumes
- Maximizing Nash product social welfare in allocating indivisible goods
- Graph minors. III. Planar tree-width
- Fair assignment of indivisible objects under ordinal preferences
- Clustering to minimize the maximum intercluster distance
- Solution methods and computational investigations for the linear bottleneck assignment problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- 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
- Two-Person Fair Division of Indivisible Items: An Efficient, Envy-Free Algorithm
- The Santa Claus problem
- Easy problems for tree-decomposable graphs
- Introduction to the Theory of Fair Allocation
- Fair Allocation of Indivisible Goods
- Parameterized Algorithms
- The complexity of theorem-proving procedures
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Preference–Approval Structures in Group Decision Making: Axiomatic Distance and Aggregation
This page was built for publication: Allocation of indivisible items with individual preference graphs
