Exact Cut Complexity of Equal-Length Proportional Cake Cutting

cs.MA, cs.AI, cs.DS, cs.GT

Submitted: 2026-10-14

Updated: 2026-10-14

Comments: A preliminary version of this paper appeared in the proceedings of the 51st International Symposium on Mathematical Foundations of Computer Science (MFCS 2026)

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Related papers

• Highway Congestion Reduction through Reinforcement Learning Based Eulerian Headway Control
• ORACLE-SWE: Quantifying the Contribution of Critical Information Signals on SWE Agents
• You Only Align Once: Propagating Cooperative Behaviors in Multi-Agent Systems through Seed Agents
• Deny Without Disabling: Authorization-Paired Evaluation and Control for Multi-Agent Systems
• MA-SAPO: Multi-Agent Reasoning for Score-Aware Prompt Optimization
• PeroMAS: A Multi-agent System of Perovskite Material Discovery