Constant inapproximability for PPA
In the ϵ-Consensus-Halving problem, we are given n probability measures v1, ..., vn on the interval R = [0,1], and the goal is to partition R into two parts R+ and R- using at most n cuts, so that |vi(R+)-vi(R-)| ≤ ϵ for all i. This fundamental fair division problem was the first natural problem sho...
| 主要な著者: | , , , |
|---|---|
| フォーマット: | Conference item |
| 言語: | English |
| 出版事項: |
Association for Computing Machinery
2022
|