Exact Envy-Free Cake Cutting with Polynomial Expected Queries
cs.GT, cs.CC
Submitted: 2026-10-20
Updated: 2026-10-20
Related papers
- Exact Regret Frontiers and Externality Scheduling in Centralized Serial-Dictatorship Bandits
- Optimizing Social Utility in Sequential Experiments
- In-Context Credit Assignment via the Core
- Temporal Liquidity Crossing for Blockchains: An EIP-1559 Extension for Admission Below the Base Fee
- Optimal Regret for Online Market Making with Limit Order Book
- Breaking 1/epsilon Barrier in Quantum Zero-Sum Games: Generalizing Metric Subregularity for Spectraplexes