Computing EF1 Allocations under Budget Constraints in Polynomial Time
cs.GT, cs.DS
Submitted: 2026-11-09
Updated: 2026-11-09
Terminology
Sources
- Fair Division of Chores with Budget Constraints
- Guaranteeing Envy-Freeness under Generalized Assignment Constraints
- EFX Exists for Three Agents
- Envy-freeness up to any item with high Nash welfare: The virtue of donating items
- Online Fair Division with Budget Constraints
- The Price of Fairness for Indivisible Goods
- Optimal Bounds on the Price of Fairness for Indivisible Goods
- A Complete Landscape for the Price of Envy-Freeness
- Computing Welfare-Maximizing Fair Allocations of Indivisible Goods
- Approximability Landscape of Welfare Maximization within Fair Allocations
Related papers
- How Many Votes is a Lie Worth? Measuring Strategyproofness through Resource Augmentation
- Effective Horizons for Prophet Inequalities with Discounted I.I.D. Rewards
- Truthful-in-Expectation Mechanism with Constant Maximin-Share Guarantee
- The Power of Recruiting the Smaller Side: Two Additional Traders Suffice in Two-Sided Markets
- From signaling to interviews in random matching markets
- Optimizing Social Utility in Sequential Experiments