Skip to content
Register Sign in Wishlist
The Geometry of Efficient Fair Division

The Geometry of Efficient Fair Division

$154.95 (C)

  • Date Published: January 2005
  • availability: Available
  • format: Hardback
  • isbn: 9780521842488

$ 154.95 (C)

Add to cart Add to wishlist

Other available formats:

Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • 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.

    • Contains the study of abstract existence results, rather than algorithms
    • A purely mathematical approach to problems that often arise in an economic setting
    • Contains interesting studies that lead to results about efficiency and about fairness that would not be apparent otherwise
    Read more

    Reviews & endorsements

    "The monograph is a clearly-written, matter-of-fact presentation of definitions, theorems, and proofs."
    MAA Reviews, Stephen Ahearn, Macalester College

    "The main virtue of the book is the depth at which the author studies the division problem while maintaining the breadth across the mathematical sciences and the mathematical elegance with which he presents the results. The book should be of special interest not only to mathematicians and mathematical scientists but also to graduate students and researchers in management science, operations research, and system science who study resource allocation, optimization and decision making."
    Margaret M. Wiecek, MATHEMATICAL REVIEWS

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: January 2005
    • format: Hardback
    • isbn: 9780521842488
    • length: 472 pages
    • dimensions: 235 x 157 x 30 mm
    • weight: 0.738kg
    • contains: 73 b/w illus.
    • availability: Available
  • Table of Contents

    0. Preface
    1. Notation and preliminaries
    2. Geometric object #1a: the individual pieces set (IPS) for two players
    3. What the IPS tells us about fairness and efficiency in the two-player context
    4. The general case of n players
    5. What the IPS and the FIPS tell us about fairness and efficiency in the n-player context
    6. Characterizing Pareto optimality: introduction and preliminary ideas
    7. Characterizing Pareto optimality I: the IPS and optimization of convex combinations of measures
    8. Characterizing Pareto optimality II: partition ratios
    9. Geometric object #2: The Radon-Nikodym set (RNS)
    10. Characterizing Pareto optimality III: the RNS, Weller's construction, and w-association
    11. The shape of the IPS
    12. The relationship between the IPS and the RNS
    13. Other issues involving Weller's construction, partition ratios, and Pareto optimality
    14. Strong Pareto optimality
    15. Characterizing Pareto optimality using hyperreal numbers
    16. The multi-cake individual pieces set (MIPS): symmetry restored.

  • Author

    Julius B. Barbanel, Union College, New York
    Julius B. Barbanel is Professor of Mathematics at Union College, where he has also served as Department Chair. He has published numerous articles in the areas of both Logic and Set Theory, and Fair Division in leading mathematical journals. He is a member of the Mathematical Association of American, the Association of Symbolic Logic, and the Game Theory Society.

    Introduction by

    Alan D. Taylor, Union College, New York

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.