Research map / Learning theory and algorithms / Submodular and game algorithms
Fair and Efficient Allocations of Chores under Bivalued Preferences
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
- Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements (AAAI 2024 · similarity 0.93)
- Repeated Fair Allocation of Indivisible Items (AAAI 2024 · similarity 0.92)
- Improved Maximin Share Approximations for Chores by Bin Packing (AAAI 2025 · similarity 0.91)
- The Complexity of Extending Fair Allocations of Indivisible Goods (AAAI 2025 · similarity 0.90)
- Towards Optimal Subsidy Bounds for Envy-Freeable Allocations (AAAI 2024 · similarity 0.90)
- Envy-Free House Allocation under Uncertain Preferences (AAAI 2024 · similarity 0.89)
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.