The Query Complexity of Envy-Free Division: Cake, Chores, and Mixed Resources
cs.GT
Submitted: 2026-11-08
Updated: 2026-11-10
Code: https://github.com/farhadi94/envy-free-division
Terminology
Sources
- A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents
- Fair Division Beyond Monotone Valuations with Applications to Equitable Graph Partitioning
- Applications of Discrepancy Theory in Multiobjective Approximation
- Active Linear Regression for $\ell_p$ Norms and Beyond
- Exact Envy-Free Cake Cutting with Polynomial Expected Queries
- Cutting a Cake For Human Consumption: An Elementary n-agent Cake Cutting Protocol
- Cutting Down the Tower: Single-Exponential Envy-Free Cake Cutting
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