Logarithmic Comparison-Query Complexity for EF1 Allocations
cs.GT
Submitted: 2026-11-03
Updated: 2026-11-03
Terminology
Sources
- The Power of Share-Based Notions in Proving Envy-Based Fairness Guarantees
- An $\Omega(n \log n)$ Randomized Lower Bound for Cutting a Cake into Proportionally Fair Pieces
- Searching, Sorting, and Cake Cutting in Rounds
- Simultaneous EF1 and approximate MMS allocations for submodular valuations
- 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