A Discrete and Bounded Envy-free Cake Cutting Protocol for Four Agents.

Haris Aziz Simon Mackenzie

Published in: CoRR (2015)

Keyphrases

envy free
resource allocation
pareto optimal
utility function
envy freeness
social welfare
additively separable
sufficient conditions
fixed point
np complete
game theoretic