How to obtain an equitable optimal fair division

Jerzy Legut ()
Additional contact information
Jerzy Legut: Wrocław University of Science and Technology

Annals of Operations Research, 2020, vol. 284, issue 1, No 14, 323-332

Abstract: Abstract A nonlinear programming method is used for finding an equitable optimal fair division of the unit interval [0, 1) among n players. Players’ preferences are described by nonatomic probability measures $$\mu _{1},\ldots ,\mu _{n}$$μ1,…,μn with density functions having piecewise strict monotone likelihood ratio property. The presented algorithm can be used to obtain also an equitable $$\varepsilon $$ε-optimal fair division in case of measures with arbitrary differentiable density functions. An example of an equitable optimal fair division for three players is given.

Keywords: Fair division; Cake cutting; Optimal partitioning of a measurable space (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-018-3053-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:284:y:2020:i:1:d:10.1007_s10479-018-3053-2

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-018-3053-2

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().