Cake-Cutting Algorithms: Be Fair if You Can
Robertson, Jack; Webb, William
Language: English
Published by A K Peters/CRC Press, 1998
- Hardcover
- New
Condition: New
US$ 199.99
Quantity: 1 available
Add to basketItem description from seller
Satisfaction Guaranteed or your money back.
Seller Inventory # 1568810768
- Title
- Cake-Cutting Algorithms: Be Fair if You Can
- Author
- Robertson, Jack; Webb, William
- Publisher
- A K Peters/CRC Press
- Publication year
- 1998
- Condition
- New
- Binding
- Hardcover
- Language
- English
- ISBN 10
- 1568810768
- ISBN 13
- 9781568810768
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.
"Synopsis" may belong to another edition of this title.
About the Author
"About the title" may belong to another edition of this title.
Shipping rates within U.S.A.
| Item | 5 to 14 business days | 5 to 14 business days |
|---|---|---|
| First item | US$ 0.00 | US$ 14.00 |
Payment methods
Specialty
Science Fiction, Fantasy, etcSeller's business information
SHIMEDIA
NY, U.S.A.