Jack Robertson, William Webb

Cake-Cutting Algorithms (eBook, ePUB)

Be Fair if You Can

• Format: ePub

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

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Taylor & Francis eBooks
• Seitenzahl: 177
• Erscheinungstermin: 15. Juli 1998
• Englisch
• ISBN-13: 9781040179499
• Artikelnr.: 73300150

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