Cake-Cutting Algorithms: Be Fair if You Can
Robertson, Jack; Webb, William
Sold by BooksRun, Philadelphia, PA, U.S.A.
AbeBooks Seller since February 2, 2016
Used - Hardcover
Condition: Used - Very good
Quantity: 1 available
Add to basketSold by BooksRun, Philadelphia, PA, U.S.A.
AbeBooks Seller since February 2, 2016
Condition: Used - Very good
Quantity: 1 available
Add to basketIt's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.
Seller Inventory # 1568810768-8-1
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.
"About this title" may belong to another edition of this title.
30 days hassle-free returns guaranteed!
Order quantity | 3 to 8 business days | 3 to 6 business days |
---|---|---|
First item | US$ 0.00 | US$ 3.99 |
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.