2 ms·
A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents
- apetresc 10y agoAn article discussing the history and significance of this problem can be found here: https://www.quantamagazine.org/20161006-new-algorithm-solves-cake-cutting-problem/ https://www.quantamagazine.org/20161006-new-algorithm-solves...