Jack Robertson, William Webb

Cake Cutting Algorithms

Be Fair If You Can

• Gebundenes Buch

Produktbeschreibung

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.

Produktdetails

• Verlag: B&T / Peters, Wellesley
• Artikelnr. des Verlages: K00362
• Seitenzahl: 177
• Erscheinungstermin: 15. Juli 1998
• Englisch
• Abmessung: 236mm x 159mm x 19mm
• Gewicht: 494g
• ISBN-13: 9781568810768
• ISBN-10: 1568810768
• Artikelnr.: 26680792

Autorenporträt

Jack Robertson, William Webb

Inhaltsangabe

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

Rezensionen

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