arXiv (All)
open access
Cutting Down the Tower: Single-Exponential Envy-Free Cake Cutting
Envy-free cake cutting is a central problem in fair division with a striking divide between existence and computation. Classical topology guarantees that envy-free allocations exist, yet finding one efficiently turned out to be much harder, and this problem has resisted decades of work. A well-known
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Polynomial Time Characterization For Strongly EFX Orientable Graphs#1131340
- The puzzle of competitive fairness#71491
- Strategyproof Multi-Resource Allocation in Cloud Computing via Adaptive-Speed Fairness#1142335
- Individual Rationality in Constrained Hedonic Games: Friends, Enemies, and Neutrals#789838
- Demonic Social Welfare: Quine, Thermodynamics, and Bounded Rationality#118892
Record · ID 972135
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive