A discrete and bounded envy-free cake cutting protocol for four agents - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Haris Aziz, Simon Mackenzie. A discrete and bounded envy-free cake cutting protocol for four agents. In Daniel Wichs, Yishay Mansour, editors, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016. pages 454-464, ACM, 2016. [doi]

This author has not been identified. Look up 'Haris Aziz' in GoogleThis author has not been identified. Look up 'Simon Mackenzie' in Google

runs on WebDSL