Aziz, Haris; MacKenzie, Simon (2016). "A discrete and bounded envy-free cake cutting protocol for any number of agents". FOCS 2016. arXiv:1604.03655. Bibcode:2016arXiv160403655A.
Arzi, Orit; Aumann, Yonatan; Dombb, Yair (2016-04-01). "Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting". Social Choice and Welfare. 46 (4): 933–954. doi:10.1007/s00355-015-0943-y. ISSN1432-217X. S2CID29132296.
Feldman, Jon; Korula, Nitish; Mirrokni, Vahab; Muthukrishnan, S.; Pál, Martin (2009). "Online Ad Assignment with Free Disposal". In Leonardi, Stefano (ed.). Internet and Network Economics. Lecture Notes in Computer Science. Vol. 5929. Springer Berlin Heidelberg. pp. 374–385. doi:10.1007/978-3-642-10841-9_34. ISBN978-3-642-10841-9.
Aziz, Haris; MacKenzie, Simon (2016). "A discrete and bounded envy-free cake cutting protocol for any number of agents". FOCS 2016. arXiv:1604.03655. Bibcode:2016arXiv160403655A.
Arzi, Orit; Aumann, Yonatan; Dombb, Yair (2016-04-01). "Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting". Social Choice and Welfare. 46 (4): 933–954. doi:10.1007/s00355-015-0943-y. ISSN1432-217X. S2CID29132296.
Arzi, Orit; Aumann, Yonatan; Dombb, Yair (2016-04-01). "Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting". Social Choice and Welfare. 46 (4): 933–954. doi:10.1007/s00355-015-0943-y. ISSN1432-217X. S2CID29132296.