Superadditivity and Subadditivity in Fair Division

Rishi S. Mirchandani

Abstract


I examine the classic problem of fair division of a piecewise homogeneous good.  Previous work developed algorithms satisfying various combinations of fairness notions (such as proportionality, envy-freeness, equitability, and Pareto-optimality).  However, this previous work assumed that all utility functions are additive.  Recognizing that additive functions accurately model utility only in certain situations, I investigate superadditive and subadditive utility functions.  Next, I propose a new division protocol that utilizes nonlinear programming and test it on a sample instance.  Finally, I prove theoretical results that address (a) relationships between fairness notions, and (b) the orthogonal issue of division efficiency (i.e., the price of satisfying particular fairness notions).

Full Text: PDF DOI: 10.5539/jmr.v5n3p78

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

Journal of Mathematics Research   ISSN 1916-9795 (Print)   ISSN 1916-9809 (Online)

Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.