Goodreads helps you keep track of books you want to read.
Start by marking “Cake Cutting Algorithms: Be Fair If You Can” as Want to Read:
Cake Cutting Algorithms: Be Fair If You Can
Enlarge cover
Rate this book
Clear rating
Open Preview

Cake Cutting Algorithms: Be Fair If You Can

0.0  ·  Rating Details ·  0 Ratings  ·  0 Reviews
A comprehensive discussion of the state-of-the-art in cake cutting problems for the novice and professional. The author offers a complete treatment of all cake cutting algorithms under all the considered definitions of fair and presents them in a reader-friendly manner.
Hardcover, 177 pages
Published July 15th 1998 by AK Peters (first published March 1998)
More Details... edit details

Friend Reviews

To see what your friends thought of this book, please sign up.

Reader Q&A

To ask other readers questions about Cake Cutting Algorithms, please sign up.

Be the first to ask a question about Cake Cutting Algorithms

This book is not yet featured on Listopia. Add this book to your favorite list »

Community Reviews

(showing 1-14)
filter  |  sort: default (?)  |  Rating Details
Frank
May 03, 2015 Frank rated it really liked it
What do you expect from a book on mathematics?

1) It should be accessible, but not trivial.
2) The concepts should by well motivated and clearly explained. (CCA consistently introduces difficult proofs - of which there are a fair share in the later chapters - with a motivational prelude).
3) It should open the way to new lines of thought.

Books meeting points 2) and 3) are hard enough to come by, but point 1) may be the most difficult of all, as the constraints apply to nearly complementary sets.

C
...more
Aaron
Dec 26, 2008 Aaron rated it it was amazing
An absolutely delightful ride through the mathematics of how to fairy share resources. The only real drawback is that the book is ten years old, so people really interested in the subject would want to further explore the contemporary research. Don't worry about not having the needed mathematical background, gentle reader; if you can follow any sort of college-level proof, you can at least get through the first seven chapters.
Kevin Zollman
Kevin Zollman rated it it was ok
Dec 22, 2015
Adam
Adam rated it really liked it
Jul 06, 2013
TK Keanini
TK Keanini marked it as to-read
Apr 13, 2007
Sudhir Kumar
Sudhir Kumar marked it as to-read
Aug 16, 2009
Himanshu
Himanshu marked it as to-read
Jan 14, 2011
Luke
Luke added it
Sep 24, 2015
Severina Gorgeous
Severina Gorgeous marked it as to-read
Dec 27, 2012
Helga Guerreiro
Helga Guerreiro marked it as to-read
Apr 29, 2014
Frederic
Frederic marked it as to-read
May 11, 2014
Cole
Cole marked it as to-read
Feb 14, 2016
There are no discussion topics on this book yet. Be the first to start one »

Share This Book