Skip to main content Accessibility help
×
  1. Home
  2. Books
  3. The Geometry of Efficient Fair Division
  • Cited by 51
      • Show more authors
      • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      August 2009
      January 2005
      ISBN:
      9780511546679
      9780521842488
      DOI:
      https://doi.org/10.1017/CBO9780511546679
      Dimensions:
      (228 x 152 mm)
      Weight & Pages:
      0.738kg, 472 Pages
      Dimensions:
      Weight & Pages:
      • Subjects:
      Economics, Mathematics, Econometrics and Mathematical Methods, Geometry and Topology
    You may already have access via personal or institutional login
    • Selected: Digital
    Add to cart View cart Buy from Cambridge.org
    Subjects:
    Economics, Mathematics, Econometrics and Mathematical Methods, Geometry and Topology
    Information

    Book description

    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.

    Reviews

    'In Chapters 12 and 13, he studies the relationship between the IPS and the RNS, and he provides a new presentation of the fundamental result that ensures the existence of a partition that is both Pareto optimal and envy-free.'

    Source: Zentralblatt MATH

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    Cancel
    ×

    Contents

    Contents

    Metrics

    Altmetric attention score

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Why this information is here

    This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

    Accessibility Information

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.