Cake-Cutting Algorithms: Be Fair If You Can - Couverture rigide

Robertson, Jack; Webb, William

 
9781568810768: Cake-Cutting Algorithms: Be Fair If You Can

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

À propos de l'auteur

Jack Robertson, William Webb

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Autres éditions populaires du même titre

9788173714481: Cake Cutting Algorithms: Be Fair If You Can

Edition présentée

ISBN 10 :  8173714487 ISBN 13 :  9788173714481
Editeur : Orient Blackswan Pvt Ltd.
Couverture souple