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]
@inproceedings{AzizM16-1, title = {A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents}, author = {Haris Aziz and Simon Mackenzie}, year = {2016}, doi = {10.1109/FOCS.2016.52}, url = {http://dx.doi.org/10.1109/FOCS.2016.52}, researchr = {https://researchr.org/publication/AzizM16-1}, cites = {0}, citedby = {0}, pages = {416-427}, booktitle = {IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA}, editor = {Irit Dinur}, publisher = {IEEE}, isbn = {978-1-5090-3933-3}, }