Name: Cake-Cutting Algorithms: Be Fair if you can
Price: 153.00 GBP
Availability: InStock
Author: Jack Robertson; William Webb
ISBN: 9781568810768

portada Cake-Cutting Algorithms: Be Fair if you can

Type

Physical Book

Publisher

A K Peters Ltd (Ma)

Author

Jack Robertson; William Webb

Year

1998

Language

English

Pages

177

Format

Hardcover

Weight

ISBN

1568810768

ISBN13

9781568810768

Edition No.

Synopsis "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, 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.

Customers reviews

Have you read this book? Login to add your review.

More customer reviews

0% (0)
0% (0)
0% (0)
0% (0)
0% (0)

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews

Cake-Cutting Algorithms: Be Fair if you can - Jack Robertson; William Webb

Synopsis "Cake-Cutting Algorithms: Be Fair if you can"

Customers reviews

Frequently Asked Questions about the Book

Is the book original?

In what language is the book written?

What is the format of this book?

Questions and Answers about the Book

Opinions about Bookdelivery