Skip to main content
Conference Proceedings

Confidently cutting a cake into approximately fair pieces

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5034 LNCS 155-164
DOI: 10.1007/978-3-540-68880-8_16
6Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We give a randomized protocol for the classic cake cutting problem that guarantees approximate proportional fairness, and with high probability uses a linear number of cuts. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Edmonds, J., Pruhs, K., & Solanki, J. (2008). Confidently cutting a cake into approximately fair pieces. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5034 LNCS, pp. 155–164). https://doi.org/10.1007/978-3-540-68880-8_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free