A discrete and bounded envy-free cake cutting protocol for four agents.

Haris Aziz Simon Mackenzie

Published in: STOC (2016)

Keyphrases

envy free
resource allocation
pareto optimal
utility function
envy freeness
social welfare
fixed point
multi agent
decision making
search space
multi objective
probability distribution
computational efficiency
additively separable