+612 9045 4394
Cake-Cutting Algorithms : Be Fair if You Can - Jack Robertson

Cake-Cutting Algorithms

Be Fair if You Can

Sorry, the book that you are looking for is not available right now.

We did a search for other books with a similar title, however there were no matches. You can try selecting from a similar category, click on the author's name, or use the search box above to find your book.

Share This Book:

The challenge of dividing an asset fairly, from cakes to more important properties, is of great practical importance in many situations. Since the famous Polish school of mathematicians (Steinhaus, Banach, and Knaster) introduced and described algorithms for the fair division problem in the 1940s, the concept has been widely popularized.

This book gathers into one readable and inclusive source a comprehensive discussion of the state of the art in cake-cutting problems for both the novice and the professional. It offers a complete treatment of all cake-cutting algorithms under all the considered definitions of "fair" and presents them in a coherent, reader-friendly manner. Robertson and Webb have brought this elegant problem to life for both the bright high school student and the professional researcher.

Cake-Cutting Algorithms will engage and challenge both veteran and novice mathematicians... -- Francis Edward Su, American Mathematical Monthly , March 2000

ISBN: 9781568810768
ISBN-10: 1568810768
Series: Ak Peters Ser.
Audience: Professional
Format: Hardcover
Language: English
Number Of Pages: 177
Published: 1st March 1998
Country of Publication: US
Dimensions (cm): 23.62 x 15.9  x 1.91
Weight (kg): 0.45
Edition Number: 1