Get Free Shipping on orders over $79
Cake-Cutting Algorithms : Be Fair if You Can - Jack Robertson

Cake-Cutting Algorithms

Be Fair if You Can

By: Jack Robertson, William Webb

eText | 15 July 1998 | Edition Number 1

At a Glance

eText


$375.10

or 4 interest-free payments of $93.78 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

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

on
Desktop
Tablet
Mobile

More in Mathematics

Men of Mathematics - E.T. Bell

eBOOK

Is God a Mathematician? - Mario Livio

eBOOK

The FTL Paper : Book Five - Tomas Londan

eBOOK