Cake-Cutting Algorithms: Be Fair if You Can

Robertson, Jack; Webb, William

ISBN 10: 1568810768 / ISBN 13: 9781568810768

Edité par A K Peters/CRC Press, 1998

A propos de cet article

USED book in GOOD condition. Great binding, pages and cover show normal signs of wear from use.

N° de réf. du vendeur GCM.2LEZ

Détails bibliographiques

• Titre: Cake-Cutting Algorithms: Be Fair if You Can
• Éditeur: A K Peters/CRC Press
• Date de parution: 1998
• Langue: anglais
• ISBN à 10 chiffres: 1568810768
• ISBN à 13 chiffres: 9781568810768
• Reliure: Couverture rigide
• État de l'article: good

A propos de ce titre

Synopsis

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.

À propos de l?auteur

Jack Robertson, William Webb