Sign In

Communications of the ACM

Research Archive


Archives

The Research archive provides access to all Research articles published in past issues of Communications of the ACM.

April 2020


From Communications of the ACM

Technical Perspective: An Answer to Fair Division's Most Enigmatic Question

The envy-free cake-cutting problem stood its ground for two decades, until it was cracked by Aziz and Mackenzie. Their solution is presented in "A Bounded and Envy-Free Cake Cutting Algorithm."


From Communications of the ACM

A Bounded and Envy-Free Cake Cutting Algorithm

A Bounded and Envy-Free Cake Cutting Algorithm

We report on our algorithm that resolved the well-studied cake cutting problem in which the goal is to find an envy-free allocation of a divisible resource based on queries from agents.