BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Cake Cutting Algorithms

Cake Cutting Algorithms

Cake Cutting Algorithms
Stock photo: cover may vary

Cake Cutting Algorithms Hardback -

by William Webb Jack Robertson

Add to wish list
  • New
  • Hardback
New

Description

A.K. Peters, Limited , pp. 177 . Hardback. New.
Ask the seller a question Add to wish list
A$348.93
A$5.81 Delivery within USA
Standard delivery: 9 to 14 days
More delivery options
Ships from Cold Books (New York, United States)

Details

  • Title Cake Cutting Algorithms
  • Author William Webb Jack Robertson
  • Binding Hardback
  • Edition First Edition; F
  • Condition New
  • Pages 177
  • Volumes 1
  • Language ENG
  • Publisher A.K. Peters, Limited , Natick MA
  • Publication date pp. 177
  • Illustrated Yes
  • Features Illustrated
  • Bookseller's Inventory # 61187413
  • ISBN 9781568810768 / 1568810768
  • Weight 1 lbs (0.45 kg)
  • Dimensions 9.3 x 6.26 x 0.75 in (23.62 x 15.90 x 1.91 cm)
  • Category Mathematics
  • Library of Congress Catalogue Number 97041258
  • Dewey Decimal Code 511.64
  • Quantity available 1

About Cold Books New York, United States

Biblio member since 2012

Terms of Sale: 30 day return guarantee, with full refund including shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Cold Books

Reader reviews for Cake Cutting Algorithms

From the publisher

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.

tracking-