Cake-Cutting Algorithms: Be Fair if You Can

by Robertson, Jack

Type Book

Rate 0.0 /5

Details

Files

Reviews

Download

Title Statements

Full title :Cake-Cutting Algorithms : Be Fair if You Can / editors, Webb, William.

Summary

"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."--Provided by publisher.

Edition Statements

Publication Date:1998.
Edition:First edition

Publication Statements

Publisher(s):CRC Press
Place of Publication:Boca Raton, FL
Language:eng
Publication Date:1998.

The Physical Object

Description:1 online resource (177 pages)

Edition Identifiers

ISBN:9781439863855, 1439863857
DOI:10.1201/9781439863855
oclc:on1019716442
LC Classification:T57.6
Dewey Decimal:511.64

Chapter 1 Fairly Dividing a Cake -- chapter 2 Pieces or Crumbs -- How Many Cuts Are Needed? -- chapter 3 Unequal Shares -- chapter 4 The Serendipity of Disagreement -- chapter 5 Some Variations on the Theme of "Fair" Division -- chapter 6 Some Combinatorial Observations -- chapter 7 Interlude: An Inventory of Results -- chapter 8 Impossibility Theorems -- chapter 9 Attempting Fair Division with a Limited Number of Cuts -- chapter 10 Exact and Envy-Free Algorithms -- chapter 11 A Return to Division for Unequal Shares.