Research map / Learning theory and algorithms / Submodular and game algorithms
Fair Knapsack
Till Fluschnik, Piotr Skowron, Mervin Triphaus, Kai Wilker
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use total voter utility as the selection objective | Individually Best Knapsack · General, unary utilities | computational complexity: polynomial time | Improved |
| Use each voter's best selected-item utility as the objective | Diverse Knapsack · Single-peaked or single-crossing, unary utilities | computational complexity: polynomial time | Improved |
| Use each voter's best selected-item utility as the objective | Diverse Knapsack · General, unary utilities; parameterized by number of voters | computational complexity: FPT | Improved |
| Use Nash welfare as the selection objective | Fair Knapsack · General, unary utilities; parameterized by number of voters | computational complexity: W[1]-hard | Hurt |
| Use Nash welfare as the selection objective | Fair Knapsack · Single-peaked and single-crossing; unit costs; utilities in {0, ..., 6} | computational complexity: NP-hard | Hurt |
| Restrict utilities to {0, 1} rather than {0, ..., 6} | Fair Knapsack · Single-peaked preferences; unit costs | computational complexity: polynomial-time solvable | Improved |
| Parameterize by both voter count and the number of distinct utility values | Fair Knapsack · General | computational complexity: FPT | Improved |
| Use a submodular approximation algorithm | Fair Knapsack with objective log(u_fair) · General; knapsack constraint | approximation ratio: (1 - 1/e) | Improved |
Closest papers by meaning
- Time Fairness in Online Knapsack Problems (ICLR 2024 · similarity 0.88)
- The Complexity of Extending Fair Allocations of Indivisible Goods (AAAI 2025 · similarity 0.86)
- The Complexity of Fair Division of Indivisible Items with Externalities (AAAI 2024 · similarity 0.86)
- Repeated Fair Allocation of Indivisible Items (AAAI 2024 · similarity 0.85)
- Proportional Fairness in Clustering: A Social Choice Perspective (NeurIPS 2024 · similarity 0.85)
- Reducing Leximin Fairness to Utilitarian Optimization (AAAI 2025 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
