Non-Fiction Books:

Cake-Cutting Algorithms

Sorry, this product is not currently available to order

Here are some other products you might consider...

Cake-Cutting Algorithms

Be Fair if You Can
Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

Format:

Hardback
Unavailable
Sorry, this product is not currently available to order

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.
Release date NZ
July 15th, 1998
Audiences
  • Postgraduate, Research & Scholarly
  • Professional & Vocational
  • Undergraduate
Pages
177
Dimensions
159x280x19
ISBN-13
9781568810768
Product ID
3664356

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Help & options

Filed under...