Cake Cutting Algorithms: Be Fair If You Can

ISBN-13: 9781568810768 / Angielski / Twarda / 1998 / 177 str.

Jack Robertson; William Webb

Opis

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.

Recenzje

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

Spis treści

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

O autorze

Jack Robertson, William Webb