Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts.

Takao Asano Hiroyuki Umeda

Published in: ISAAC (2020)

Keyphrases

envy free
small number
resource allocation
pareto optimal
mechanism design
utility function
social welfare
strategy proof
additively separable
fixed point
lower bound
dynamic programming
envy freeness