Cake-Cutting Algorithms: Be Fair if You Can

Author:   Jack Robertson ,  William Webb
Publisher:   Taylor & Francis Inc
ISBN:  

9781568810768


Pages:   177
Publication Date:   15 July 1998
Format:   Hardback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $368.00 Quantity:  
Add to Cart

Share |

Cake-Cutting Algorithms: Be Fair if You Can


Add your own review!

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

Full Product Details

Author:   Jack Robertson ,  William Webb
Publisher:   Taylor & Francis Inc
Imprint:   A K Peters
Dimensions:   Width: 15.20cm , Height: 1.90cm , Length: 22.90cm
Weight:   0.498kg
ISBN:  

9781568810768


ISBN 10:   1568810768
Pages:   177
Publication Date:   15 July 1998
Audience:   College/higher education ,  Professional and scholarly ,  Undergraduate ,  Postgraduate, Research & Scholarly
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

Reviews

Cake-Cutting Algorithms will engage and challenge both veteran and novice mathematicians... -Francis Edward Su, American Mathematical Monthly , March 2000


Cake-Cutting Algorithms will engage and challenge both veteran and novice mathematicians... -- Francis Edward Su, American Mathematical Monthly , March 2000


Author Information

Jack Robertson, William Webb

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

lgn

al

Shopping Cart
Your cart is empty
Shopping cart
Mailing List