Cake-Cutting Algorithms: Be Fair if You Can, 1st Edition (Hardback) book cover

Cake-Cutting Algorithms

Be Fair if You Can, 1st Edition

By Jack Robertson, William Webb

A K Peters/CRC Press

177 pages

Purchasing Options:$ = USD
Hardback: 9781568810768
pub: 1998-07-15
$51.95
x
eBook (VitalSource) : 9780429192159
pub: 1998-07-15
from $25.98


FREE Standard Shipping!

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.

Reviews

Cake-Cutting Algorithms will engage and challenge both veteran and novice mathematicians…

-- Francis Edward Su, American Mathematical Monthly , March 2000

Subject Categories

BISAC Subject Codes/Headings:
MAT036000
MATHEMATICS / Combinatorics