CakeCutting Algorithms: Be Fair if You Can,Used

CakeCutting Algorithms: Be Fair if You Can,Used

In Stock
SKU: SONG1568810768
Brand: A K Peters/CRC Press
$50.22
Quantity
Add to wishlist
Add to compare

Processing time: 1-3 days

US Orders Ships in: 3-5 days

International Orders Ships in: 8-12 days

Return Policy: 15-days return on defective items

Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

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 cakecutting problems for both the novice and the professional. It offers a complete treatment of all cakecutting algorithms under all the considered definitions of 'fair' and presents them in a coherent, readerfriendly manner. Robertson and Webb have brought this elegant problem to life for both the bright high school student and the professional researcher.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed