Produktart
Zustand
Einband
Weitere Eigenschaften
Land des Verkäufers
Verkäuferbewertung
Verlag: Cambridge University Press, 2005
ISBN 10: 0521842484ISBN 13: 9780521842488
Anbieter: Powell's Bookstores Chicago, ABAA, Chicago, IL, USA
Buch
Zustand: Used - Very Good. 2005. Hardcover. Very Good.
Verlag: Cambridge University Press, 2005
ISBN 10: 0521842484ISBN 13: 9780521842488
Anbieter: Powell's Bookstores Chicago, ABAA, Chicago, IL, USA
Buch
Zustand: Used - Like New. 2005. Hardcover. Fine. No Dust Jacket.
Verlag: Cambridge University Press, 2005
ISBN 10: 0521842484ISBN 13: 9780521842488
Anbieter: WorldofBooks, Goring-By-Sea, WS, Vereinigtes Königreich
Buch
Hardback. Zustand: Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.
Verlag: Cambridge University Press, 2005
ISBN 10: 0521842484ISBN 13: 9780521842488
Anbieter: Plurabelle Books Ltd, Cambridge, Vereinigtes Königreich
Verbandsmitglied: GIAQ
Buch
Hardcover. Zustand: Good. ix 462p bright blue illustrated boards with yellow lettering to spine, an excellent copy, like new Language: English.
Verlag: Cambridge University Press, 2005
ISBN 10: 0521842484ISBN 13: 9780521842488
Anbieter: Antiquariaat Ovidius, Bredevoort, Niederlande
Buch
Zustand: Gebraucht / Used. Fine state d575e.
Verlag: Cambridge University Press, 2005
ISBN 10: 0521842484ISBN 13: 9780521842488
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - What is the best way to divide a 'cake' and allocate the pieces among some finite collection of players In this book, the cake is a measure space, and each player uses a countably additive, non-atomic probability measure to evaluate the size of the pieces of cake, with different players generally using different measures. The author investigates efficiency properties (is there another partition that would make everyone at least as happy, and would make at least one player happier, than the present partition ) and fairness properties (do all players think that their piece is at least as large as every other player's piece ). He focuses exclusively on abstract existence results rather than algorithms, and on the geometric objects that arise naturally in this context. By examining the shape of these objects and the relationship between them, he demonstrates results concerning the existence of efficient and fair partitions.