ACM Symposium on Theory of Computing, STOC 2016


Article Details
Title: A discrete and bounded envy-free cake cutting protocol for four agents
Article URLs:
Alternative Article URLs:
Authors: Haris Aziz
  • Data61
  • UNSW
Simon Mackenzie
  • Data61
  • UNSW
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/stoc/AzizM16
Author Comments:

Discuss this paper and its artifacts below