Join Books.org — it's free

General & Miscellaneous Law, Mathematical Analysis - General & Miscellaneous, Mathematical Programming & Operations Research, Mathematics - Problems & Exercises, General & Heavy Industry - General & Miscellaneous
Cake-Cutting Algorithms: Be Fair if You Can by Jack Robertson β€” book cover

Cake-Cutting Algorithms: Be Fair if You Can

by Jack Robertson, William Webb
Available on Bookshop Write a review

Books.org participates in affiliate programs including Bookshop.org and the Amazon Services LLC Associates Program. We may earn a commission from qualifying purchases made through links on this page, at no additional cost to you.

Log in to track your reading progress.

Overview

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.

Synopsis

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.

Booknews

Examines the many definitions of "fair division" that have been proposed throughout the years and what is known about cake-cutting algorithms as they apply to these definitions. The first seven chapters provide a leisurely survey of the problem, written with the novice in mind, without mathematical formalism. The final four chapters, for the non-casual reader, contain the technical details of proofs for the previous chapters. Exercises and projects are included in most of the chapters and the solutions for all of the exercises are included. Annotation c. by Book News, Inc., Portland, Or.

Reviews

There are no reviews yet. Log in to write one.

Editorials

Booknews

Examines the many definitions of "fair division" that have been proposed throughout the years and what is known about cake-cutting algorithms as they apply to these definitions. The first seven chapters provide a leisurely survey of the problem, written with the novice in mind, without mathematical formalism. The final four chapters, for the non-casual reader, contain the technical details of proofs for the previous chapters. Exercises and projects are included in most of the chapters and the solutions for all of the exercises are included. Annotation c. by Book News, Inc., Portland, Or.

Book Details

Published
March 1, 1998
Publisher
CRC Press
Pages
177
Format
Hardcover
ISBN
9781568810768

More by Jack Robertson

Similar books