Superadditivity and Subadditivity in Fair Division
- Rishi 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
This work is licensed under a Creative Commons Attribution 4.0 License.
Journal Metrics
- h-index (December 2021): 22
- i10-index (December 2021): 78
- h5-index (December 2021): N/A
- h5-median (December 2021): N/A
( The data was calculated based on Google Scholar Citations. Click Here to Learn More. )
Index
- Academic Journals Database
- ACNP
- Aerospace Database
- BASE (Bielefeld Academic Search Engine)
- Civil Engineering Abstracts
- CNKI Scholar
- COPAC
- DTU Library
- EconPapers
- Elektronische Zeitschriftenbibliothek (EZB)
- EuroPub Database
- Google Scholar
- Harvard Library
- IDEAS
- Infotrieve
- JournalTOCs
- LOCKSS
- MathGuide
- MathSciNet
- MIAR
- PKP Open Archives Harvester
- Publons
- RePEc
- ResearchGate
- Scilit
- SHERPA/RoMEO
- SocioRePEc
- Standard Periodical Directory
- Technische Informationsbibliothek (TIB)
- The Keepers Registry
- UCR Library
- Universe Digital Library
- WorldCat
Contact
- Sophia WangEditorial Assistant
- jmr@ccsenet.org