On the Nisan-Ronen conjecture
The Nisan-Ronen conjecture states that no truthful mechanism for makespan-minimization when allocating m tasks to n unrelated machines can have approximation ratio less than n. Over more than two decades since its formulation, little progress has been made in resolving it and the best known lower bo...
| 主要な著者: | , , |
|---|---|
| フォーマット: | Journal article |
| 言語: | English |
| 出版事項: |
Association for Computing Machinery
2022
|