"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."
By:
Jack Robertson, William Webb Imprint: A K Peters Country of Publication: United States Dimensions:
Height: 229mm,
Width: 152mm,
Spine: 19mm
Weight: 498g ISBN:9781568810768 ISBN 10: 1568810768 Pages: 177 Publication Date:15 July 1998 Audience:
College/higher education
,
Professional and scholarly
,
Professional & Vocational
,
A / AS level
,
Further / Higher Education
Format:Hardback Publisher's Status: Active
Jack Robertson, William Webb
Reviews for Cake-Cutting Algorithms: Be Fair if You Can
Cake-Cutting Algorithms will engage and challenge both veteran and novice mathematicians... -- Francis Edward Su, American Mathematical Monthly , March 2000