Obtaining a proportional allocation by deleting items

DOI10.1007/s00453-020-00794-4OpenAlexW2618393581MaRDI QIDQ5925523

Ildikó Schlotter, Britta Dorn, Ronald de Haan

Publication date: 19 April 2021

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-020-00794-4

zbMATH Keywords

controlcomputational complexityfair divisionparameterized complexityproportional allocationitem deletion

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Fundamentals of parameterized complexity
• Fun with algorithms. 6th international conference, FUN 2012, Venice, Italy, June 4--6, 2012. Proceedings
• Strong computational lower bounds via parameterized complexity
• Fair assignment of indivisible objects under ordinal preferences
• How hard is it to control an election?
• Which problems have strongly exponential complexity?
• Fair division with subsidy
• Parametrized complexity theory.
• Two-Person Fair Division of Indivisible Items: An Efficient, Envy-Free Algorithm
• Fixed-Parameter Tractability and Completeness I: Basic Results
• Waste Makes Haste
• Fair Allocation of Indivisible Goods
• Model-Checking Problems as a Basis for Parameterized Intractability
• Computational Complexity
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Hard tiling problems with simple tiles

This page was built for publication: Obtaining a proportional allocation by deleting items