
Cake Cutting Algorithms
Be Fair if You Can
A K Peters (Publisher)
1st Edition
Published on 15. July 1998
Book
177 pages
978-1-56881-076-8 (ISBN)
Description
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.
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.
Reviews / Votes
Cake-Cutting Algorithms will engage and challenge both veteran and novice mathematicians...-- Francis Edward Su, American Mathematical Monthly , March 2000
More details
Language
English
Place of publication
Natick
United States
Publishing group
Taylor & Francis Inc
Target group
College/higher education
Professional and scholarly
General and Professional Practice & Development
Product notice
sewn/stitched
Cloth over boards
Dimensions
Height: 236 mm
Width: 159 mm
Thickness: 19 mm
Weight
454 gr
ISBN-13
978-1-56881-076-8 (9781568810768)
Schweitzer Classification
Other editions
Additional editions

E-Book
07/1998
1st Edition
CRC Press
€251.99
Available for download

E-Book
07/1998
1st Edition
CRC Press
€251.99
Available for download
Persons
Jack Robertson, William Webb
Content
Preface 1 Fairly Dividing a Cake 2 Pieces or Crumbs - How Many Cuts Are Needed? 3 Unequal Shares 4 The Serendipity of Disagreement 5 Some Variations on the Theme of ''Fair'' Division 6 Some Combinatorial Observations 7 Interlude: An Inventory of Results 8 Impossibility Theorems 9 Attempting Fair Division with a Limited Number of Cuts 10 Exact and Envy-Free Algorithms 11 A Return to Division for Unequal Shares