Research map / Learning theory and algorithms / Submodular and game algorithms
The Complexity of Computing Maximin Share Allocations on Graphs
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- The Price of Connectivity in Fair Division (AAAI 2021 · similarity 0.93)
- Improved Maximin Share Approximations for Chores by Bin Packing (AAAI 2025 · similarity 0.90)
- Maxileximin Envy Allocations and Connected Goods (AAAI 2024 · similarity 0.90)
- Achieving Maximin Share and EFX/EF1 Guarantees Simultaneously (AAAI 2025 · similarity 0.89)
- The Complexity of Extending Fair Allocations of Indivisible Goods (AAAI 2025 · similarity 0.88)
- 1/2-Approximate MMS Allocation for Separable Piecewise Linear Concave Valuations (AAAI 2024 · similarity 0.87)
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.