IEEE Foundations of Computer Science, FOCS 2016


Article Details
Title: A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents
Article URLs:
Alternative Article URLs:
Authors: Haris Aziz
  • CSIRO, Data61
  • University of New South Wales
Simon Mackenzie
  • CSIRO, Data61
  • University of New South Wales
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/focs/AzizM16
Author Comments:

Discuss this paper and its artifacts below