Cake-Cutting Algorithms
Be Fair if You Can
Seiten
1998
A K Peters (Verlag)
978-1-56881-076-8 (ISBN)
A K Peters (Verlag)
978-1-56881-076-8 (ISBN)
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.
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.
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.
Jack Robertson, William Webb
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
| Erscheint lt. Verlag | 15.7.1998 |
|---|---|
| Verlagsort | Natick |
| Sprache | englisch |
| Maße | 152 x 229 mm |
| Gewicht | 498 g |
| Einbandart | gebunden |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Angewandte Mathematik |
| Mathematik / Informatik ► Mathematik ► Arithmetik / Zahlentheorie | |
| Mathematik / Informatik ► Mathematik ► Graphentheorie | |
| ISBN-10 | 1-56881-076-8 / 1568810768 |
| ISBN-13 | 978-1-56881-076-8 / 9781568810768 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Anwendungen und Theorie von Funktionen, Distributionen und Tensoren
Buch | Softcover (2023)
De Gruyter Oldenbourg (Verlag)
69,95 €
