Research map / Learning theory and algorithms / Submodular and game algorithms
Approximately Envy-free and Equitable Allocations of Indivisible Items for Non-monotone Valuations
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
- Nearly Equitable Allocations beyond Additivity and Monotonicity (AAAI 2024 · similarity 0.94)
- Towards Optimal Subsidy Bounds for Envy-Freeable Allocations (AAAI 2024 · similarity 0.94)
- The Complexity of Fair Division of Indivisible Items with Externalities (AAAI 2024 · similarity 0.93)
- Epistemic EFX Allocations Exist for Monotone Valuations (AAAI 2025 · similarity 0.93)
- The Complexity of Extending Fair Allocations of Indivisible Goods (AAAI 2025 · similarity 0.92)
- Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements (AAAI 2024 · similarity 0.92)
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.