Cake-Cutting Algorithms: Be Fair if You Can

1st Edition

Jack Robertson, William Webb

A K Peters/CRC Press
Published July 15, 1998
Reference - 177 Pages
ISBN 9781568810768 - CAT# K00362

For Instructors Request Inspection Copy

USD$51.95

Add to Wish List
FREE Standard Shipping!

Summary

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.

Instructors

We provide complimentary e-inspection copies of primary textbooks to instructors considering our books for course adoption.

Request an
e-inspection copy

Share this Title