Cake-Cutting Algorithms
Be Fair if You Can
1st Edition
Published on 15. July 1998
177 pages
978-1-040-17949-9 (ISBN)
Description
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
Reviews / Votes
Cake-Cutting Algorithms will engage and challenge both veteran and novice mathematicians...-- Francis Edward Su, American Mathematical Monthly , March 2000
More details
Edition
1. Auflage
Language
English
Place of publication
Florida
United States
Publishing group
Taylor & Francis Inc
Target group
Professional and scholarly
ISBN-13
978-1-040-17949-9 (9781040179499)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Book
07/1998
1st Edition
A K Peters
€257.50
Shipment within 3-4 weeks
Content
Preface 1 Fairly Dividing a Cake 2 Pieces or Crumbs - How Many Cuts Are Needed? 3 Unequal Shares 4 The Serendipity of Disagreement 5 Some Variations on the Theme of ''Fair'' Division 6 Some Combinatorial Observations 7 Interlude: An Inventory of Results 8 Impossibility Theorems 9 Attempting Fair Division with a Limited Number of Cuts 10 Exact and Envy-Free Algorithms 11 A Return to Division for Unequal Shares
