Cake-Cutting Algorithms: Be Fair if You Can PDF

Cake-Cutting Algorithms: Be Fair if You Can PDF

Name:
Cake-Cutting Algorithms: Be Fair if You Can PDF

Published Date:
07/15/1998

Status:
[ Active ]

Description:

Publisher:
CRC Press Books

Document status:
Active

Format:
Electronic (PDF)

Delivery time:
10 minutes

Delivery time (for Russian version):
200 business days

SKU:

Choose Document Language:
$17.4
Need Help?
ISBN: 9781439863855

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.
Edition : 98
Number of Pages : 192
Published : 07/15/1998
isbn : 9781439863855

History


Related products


Best-Selling Products

BS ISO/PAS 12006-3:2001
Published Date: 01/09/2002
Building construction. Organization of information about construction works-Framework for object-oriented information exchange
$92.964
BS ISO/PAS 17984:2001
Published Date: 08/15/2001
Machine-made textile floor coverings. Determination of dimensional changes after exposure to heat and/or water
$57.15