Polynomial-Time Approximate EFX for Chores via Flow and Matching
cs.GT
Submitted: 2026-11-05
Updated: 2026-11-05
Terminology
Sources
- EFX for Additive Chores: Nonexistence, Pareto Incompatibility, and Bi-Valued Existence
- Approximate EFX and Exact tEFX Allocations for Indivisible Chores: Improved Algorithms
- A Note on EFX Inapproximability for Chores
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