A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Efficient Splitting of Measures and Necklaces
[article]
2020
arXiv
pre-print
We provide approximation algorithms for two problems, known as NECKLACE SPLITTING and ϵ-CONSENSUS SPLITTING. In the problem ϵ-CONSENSUS SPLITTING, there are n non-atomic probability measures on the interval [0, 1] and k agents. The goal is to divide the interval, via at most n (k-1) cuts, into pieces and distribute them to the k agents in an approximately equitable way, so that the discrepancy between the shares of any two agents, according to each measure, is at most 2 ϵ / k. It is known that
arXiv:2006.16613v1
fatcat:zmjna7flnvez7nu5pdoovs2l3a