Research map / Learning theory and algorithms / Submodular and game algorithms
When Can the Maximin Share Guarantee Be Guaranteed?
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
- 1/2-Approximate MMS Allocation for Separable Piecewise Linear Concave Valuations (AAAI 2024 · similarity 0.92)
- Achieving Maximin Share and EFX/EF1 Guarantees Simultaneously (AAAI 2025 · similarity 0.92)
- Plant-and-Steal: Truthful Fair Allocations via Predictions (NeurIPS 2024 · similarity 0.89)
- Epistemic Pairwise Maximin Share (NeurIPS 2026 · similarity 0.89)
- Constrained Fair and Efficient Allocations (AAAI 2025 · similarity 0.88)
- On Optimal Tradeoffs between EFX and Nash Welfare (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.