A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Haris Aziz, Simon Mackenzie. A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents. In Irit Dinur, editor, IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA. pages 416-427, IEEE, 2016. [doi]

The following publications are possibly variants of this publication:

A discrete and bounded envy-free cake cutting protocol for four agentsHaris Aziz, Simon Mackenzie. stoc 2016: 454-464 [doi]

Bounded and envy-free cake cuttingHaris Aziz, Simon Mackenzie. sigecom, 15(2):30-33, 2017. [doi]

A bounded and envy-free cake cutting algorithmHaris Aziz 0001, Simon Mackenzie. CACM, 63(4):119-126, 2020. [doi]

runs on WebDSL