On Finding Optimal Partitions of Measurable Space
Marco Dall’Aglio; Jerzy Legut; Maciej Wilczyński
Mathematica Applicanda (2015)
- Volume: 43, Issue: 2
- ISSN: 1730-2668
Access Full Article
topAbstract
topHow to cite
topMarco Dall’Aglio, Jerzy Legut, and Maciej Wilczyński. "On Finding Optimal Partitions of Measurable Space." Mathematica Applicanda 43.2 (2015): null. <http://eudml.org/doc/293482>.
@article{MarcoDall2015,
abstract = {We present an algorithm for finding almost optimal partitions of the unit interval [0; 1) according to given nonatomic measures 1; 2; : : : ; n. This algorithm is based on the idea of Riemann integral and the linear programming method. We also discuss the number of cuts needed for finding the optimal partitions.},
author = {Marco Dall’Aglio, Jerzy Legut, Maciej Wilczyński},
journal = {Mathematica Applicanda},
keywords = {fair division, cake cutting, measurable space, optimal partitioning},
language = {eng},
number = {2},
pages = {null},
title = {On Finding Optimal Partitions of Measurable Space},
url = {http://eudml.org/doc/293482},
volume = {43},
year = {2015},
}
TY - JOUR
AU - Marco Dall’Aglio
AU - Jerzy Legut
AU - Maciej Wilczyński
TI - On Finding Optimal Partitions of Measurable Space
JO - Mathematica Applicanda
PY - 2015
VL - 43
IS - 2
SP - null
AB - We present an algorithm for finding almost optimal partitions of the unit interval [0; 1) according to given nonatomic measures 1; 2; : : : ; n. This algorithm is based on the idea of Riemann integral and the linear programming method. We also discuss the number of cuts needed for finding the optimal partitions.
LA - eng
KW - fair division, cake cutting, measurable space, optimal partitioning
UR - http://eudml.org/doc/293482
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.