Get Free Shipping on orders over $89
Cake Cutting Algorithms : Be Fair If You Can - Jack Robertson

Cake Cutting Algorithms

Be Fair If You Can

By: Jack Robertson, William Webb

Hardcover | 15 July 1998 | Edition Number 1

At a Glance

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

More in Combinatorics & Graph Theory

Weakened Ramsey Theory : Discrete Mathematics and Its Applications - Mark R.  Budden
The Math Thought Mindset : Logic, Reasoning, and Proofs - James L. Burk
A Tour through Graph Theory : Textbooks in Mathematics - Karin R. Saoub
A Tour through Graph Theory : Textbooks in Mathematics - Karin R. Saoub
Introduction to Modern Cryptography : Revised Third Edition - Jonathan  Katz
Principles And Techniques In Combinatorics - Chuan Chong Chen

RRP $70.99

$63.99

10%
OFF
Imo Problems, Theorems, And Methods : Combinatorics - Guangyu Xu