Research map / Learning theory and algorithms / Sample complexity
The Query Complexity of Cake Cutting
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- On Hierarchies of Fairness Notions in Cake Cutting: From Proportionality to Super Envy-Freeness (NeurIPS 2025 · similarity 0.91)
- Fair Division via the Cake-Cutting Share (AAAI 2025 · similarity 0.86)
- The Complexity of Extending Fair Allocations of Indivisible Goods (AAAI 2025 · similarity 0.86)
- The Complexity of Fair Division of Indivisible Items with Externalities (AAAI 2024 · similarity 0.85)
- A Near Linear Query Lower Bound for Submodular Maximization (ICML 2025 · similarity 0.85)
- Envy-Free House Allocation under Uncertain Preferences (AAAI 2024 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.