Banner Text

Banner Slogan
Member Login
User Name:
Password:
Register
Transatlantic Publishers Group Ltd.
Box 242
235 Earls Court Road
London SW5 9FE
United Kingdom
Tel +44 (0) 207373 2515
Fax +44 (0) 207244 1018
Email Us

Cake-Cutting Algorithms: Be Fair if You Can

Back

Cake-Cutting Algorithms: Be Fair if You Can
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, Banch, 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.

 

Product Code Description Attributes Price 
Jack Robertson, William Webb ISBN: 9781568810768 Hardback - 1998 £34.00

In categories:

A K Peters

Prices include:

0% VAT

Discounts: