Cake-Cutting Algorithms

Name: Cake-Cutting Algorithms
Brand: A K PETERS LTD (MA)
Price: 341.75 AUD
Availability: BackOrder

Be Fair if You Can

By: Jack Robertson, William Webb

Write A Review

Hardcover | 15 July 1998 | Edition Number 1

At a Glance

Hardcover
177 Pages

Dimensions(cm)
22.9 x 15.2 x 1.8

Hardcover

RRP $399.00

$341.75

14%OFF

or 4 interest-free payments of $85.44 with

or

Available for Backorder. We will order this from our supplier however there isn't a current ETA.

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.

Industry Reviews

Cake-Cutting Algorithms will engage and challenge both veteran and novice mathematicians... -- Francis Edward Su, American Mathematical Monthly , March 2000

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.