Delivery included to the United States

Cake-Cutting Algorithms

Cake-Cutting Algorithms Be Fair If You Can

Hardback (15 Jul 1998)

  • $252.75
Add to basket

Includes delivery to the United States

10+ copies available online - Usually dispatched within 7-10 days

Publisher's Synopsis

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.

Book information

ISBN: 9781568810768
Publisher: CRC Press
Imprint: CRC Press
Pub date:
DEWEY: 511.64
DEWEY edition: 21
Language: English
Number of pages: 181
Weight: 384g
Height: 231mm
Width: 159mm
Spine width: 18mm