Cake-Cutting Algorithms: Be Fair if You Can
Autor Jack Robertson, William Webben Limba Engleză Hardback – 15 iul 1998
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.
Preț: 986.93 lei
Preț vechi: 1366.58 lei
-28% Nou
Puncte Express: 1480
Preț estimativ în valută:
188.87€ • 196.46$ • 155.93£
188.87€ • 196.46$ • 155.93£
Carte tipărită la comandă
Livrare economică 14-28 aprilie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781568810768
ISBN-10: 1568810768
Pagini: 177
Dimensiuni: 152 x 229 x 19 mm
Greutate: 0.45 kg
Ediția:1
Editura: CRC Press
Colecția A K Peters/CRC Press
Locul publicării:United States
ISBN-10: 1568810768
Pagini: 177
Dimensiuni: 152 x 229 x 19 mm
Greutate: 0.45 kg
Ediția:1
Editura: CRC Press
Colecția A K Peters/CRC Press
Locul publicării:United States
Public țintă
General and Professional Practice & DevelopmentRecenzii
Cake-Cutting Algorithms will engage and challenge both veteran and novice mathematicians...
-- Francis Edward Su, American Mathematical Monthly , March 2000
-- Francis Edward Su, American Mathematical Monthly , March 2000
Cuprins
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
Descriere
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.