Menu
General Books
Manufacturing Books
Customer Service books
Marketing Books
Sales & Selling Books
Information
Payment Methods
Shipping
Safe Shopping
Contact Us

 

Cheap Book Store - Cake-Cutting Algorithms: Be Fair if You Can

Cake-Cutting Algorithms: Be Fair if You Can
List Price: $42.00
Our Price: $42.00
Your Save: $ ( % )
Availability: Usually ships in 24 hours
Manufacturer: A K Peters/CRC Press
Average Customer Rating: [ not yet rated ]

Buy it now at Amazon.com!

Binding: Hardcover
EAN: 9781568810768
ISBN: 1568810768
Label: A K Peters/CRC Press
Manufacturer: A K Peters/CRC Press
Number Of Items: 1
Number Of Pages: 177
Publication Date: 1998-07-15
Publisher: A K Peters/CRC Press
Studio: A K Peters/CRC Press

Related Items

Editorial Reviews:

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.




Buy it now at Amazon.com!

 
Copyright © 2000-2004 Cheap Book Store. All rights reserved.