Parameterized complexity of envy-free resource allocation in social networks
From MaRDI portal
Publication:2680801
DOI10.1016/j.artint.2022.103826OpenAlexW4309197441MaRDI QIDQ2680801
Eduard Eiben, Sebastian Ordyniak, Thekla Hamm, Robert Ganian
Publication date: 4 January 2023
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2022.103826
Related Items
On fair division with binary valuations respecting social networks ⋮ Fair division with minimal withheld information in social networks
Cites Work
- Fundamentals of parameterized complexity
- Sparsity. Graphs, structures, and algorithms
- On the complexity of some colorful problems parameterized by treewidth
- Graph minors. I. Excluding a forest
- All structured programs have small tree width and good register allocation
- Treewidth. Computations and approximations
- Which problems have strongly exponential complexity?
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- Envy-free allocations respecting social networks
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
- The rank-width of edge-coloured graphs
- Approximating clique-width and branch-width
- A $c^k n$ 5-Approximation Algorithm for Treewidth
- Integer Programming with a Fixed Number of Variables
- Graph Layout Problems Parameterized by Vertex Cover
- Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
- Polynomiality for Bin Packing with a Constant Number of Item Types
- Fair Allocation of Indivisible Goods
- Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol
- Parameterized Algorithms
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Parameterized complexity of envy-free resource allocation in social networks
