Order Total (1 Item Items):
Shipping Destination:
Cake Cutting Algorithms Fair by Robertson Jack Webb William (11 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (11)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (3)
- As New, Fine or Near Fine (1)
- Very Good or Good (7)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
- All Bindings
- Hardcover (11)
- Softcover (No further results match this refinement)
Collectible Attributes
- First Edition (1)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (4)
- Not Print on Demand (10)
Language (2)
Free Shipping
Seller Location
Seller Rating
-
Cake-Cutting Algorithms: Be Fair if You Can
Published by A K Peters/CRC Press (edition 1), 1998
ISBN 10: 1568810768 ISBN 13: 9781568810768
Language: English
Hardcover. Condition: Very Good. 1. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.
-
Hardcover. Condition: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 2.25.
-
Cake-Cutting Algorithms: Be Fair if You Can
Published by A K Peters/CRC Press, 1998
ISBN 10: 1568810768 ISBN 13: 9781568810768
Language: English
Seller: Goodwill of Silicon Valley, SAN JOSE, CA, U.S.A.
Seller rating 4 out of 5 stars
Condition: good. Supports Goodwill of Silicon Valley job training programs. The cover and pages are in Good condition! Any other included accessories are also in Good condition showing use. Use can include some highlighting and writing, page and cover creases as well as other types visible wear.
-
Cake-Cutting Algorithms: Be Fair if You Can
Published by A K Peters/CRC Press, 1998
ISBN 10: 1568810768 ISBN 13: 9781568810768
Language: English
Condition: good. USED book in GOOD condition. Great binding, pages and cover show normal signs of wear from use.
-
hardcover. Condition: Very Good. Hardcover book no dust jacket. Light wear to book cover and book edges.
-
Hardcover. Condition: Fine. Hardcover copy is Fine. Would be As New except for some light rubbing on boards. Text is pristine and binding as if unopened. book.
-
Cake-Cutting Algorithms: Be Fair if You Can
Published by A K Peters/CRC Press, 1998
ISBN 10: 1568810768 ISBN 13: 9781568810768
Language: English
First Edition
Hardcover. Condition: Very Good. No Jacket. 1st Edition. 1st edition. Hardbound, no dust jacket.
-
£ 21.96
Convert currency£ 53.65 shipping from Germany to U.S.A.Quantity: 1 available
Add to baskethardcover. Condition: Gut. 181 Seiten; 9781568810768.3 Gewicht in Gramm: 1.
-
Cake-Cutting Algorithms: Be Fair if You Can
Published by A K Peters/CRC Press 1998-07-15, 1998
ISBN 10: 1568810768 ISBN 13: 9781568810768
Language: English
£ 141.86
Convert currency£ 15.49 shipping from United Kingdom to U.S.A.Quantity: 5 available
Add to basketHardcover. Condition: New.
-
Cake-Cutting Algorithms: Be Fair if You Can
Published by A K Peters/CRC Press, 1998
ISBN 10: 1568810768 ISBN 13: 9781568810768
Language: English
Hardcover. Condition: New. In shrink wrap. Looks like an interesting title!
-
£ 180.43
Convert currency£ 42.74 shipping from Germany to U.S.A.Quantity: Over 20 available
Add to basketGebunden. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Jack Robertson, William WebbThe 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) int.
