Envy-free allocations respecting social networks
From MaRDI portal
Publication:2124438
DOI10.1016/j.artint.2022.103664OpenAlexW4206998258MaRDI QIDQ2124438
Andrzej Kaczmarczyk, Robert Bredereck, Rolf Niedermeier
Publication date: 11 April 2022
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.11596
Related Items
On reachable assignments under dichotomous preferences ⋮ Parameterized complexity of envy-free resource allocation in social networks ⋮ On fair division with binary valuations respecting social networks ⋮ Fair division with minimal withheld information in social networks ⋮ Fair division with minimal withheld information in social networks ⋮ Optimizing social welfare in social networks ⋮ The Price of Connectivity in Fair Division
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed fair allocation of indivisible goods
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Fair assignment of indivisible objects under ordinal preferences
- Welfare bounds in the fair division problem
- Constrained swap dynamics over a social network in distributed resource reallocation
- Subset sum problems with digraph constraints
- Bin packing with fixed number of bins revisited
- Almost envy-free allocations with connected bundles
- Optimizing social welfare in social networks
- On social envy-freeness in multi-unit markets
- Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask).
- Integer Programming with a Fixed Number of Variables
- Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
- On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences
- Fair Allocation of Indivisible Goods
- Cake Cutting Algorithms
- Fairly allocating contiguous blocks of indivisible items
