Cake-Cutting Algorithms: Be Fair if You Can
Description:
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.
Best prices to buy, sell, or rent ISBN 9781568810768
Frequently Asked Questions about Cake-Cutting Algorithms: Be Fair if You Can
The price for the book starts from $64.55 on Amazon and is available from 16 sellers at the moment.
If you’re interested in selling back the Cake-Cutting Algorithms: Be Fair if You Can book, you can always look up BookScouter for the best deal. BookScouter checks 30+ buyback vendors with a single search and gives you actual information on buyback pricing instantly.
As for the Cake-Cutting Algorithms: Be Fair if You Can book, the best buyback offer comes from and is $ for the book in good condition.
The Cake-Cutting Algorithms: Be Fair if You Can book is in very low demand now as the rank for the book is 3,487,145 at the moment. A rank of 1,000,000 means the last copy sold approximately a month ago.
The highest price to sell back the Cake-Cutting Algorithms: Be Fair if You Can book within the last three months was on November 30 and it was $17.44.