112 citations · 871 across the 84 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2016
A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents
Haris Aziz, Simon Mackenzie
We consider the well-studied cake cutting problem in which the goal is to find an envy-free allocation based on queries from agents. The problem has received attention in compu…
cs.DS2015★ 1 cited
A Discrete and Bounded Envy-free Cake Cutting Protocol for Four Agents
Haris Aziz, Simon Mackenzie
We consider the well-studied cake cutting problem in which the goal is to identify a fair allocation based on a minimal number of queries from the agents. The problem has attracted…