
arXiv: 2301.11905
We show that the best approximation ratio of deterministic truthful mechanisms for makespan-minimization for n unrelated machines is n , as it was conjectured by Noam Nisan and Amir Ronen.
FOS: Computer and information sciences, Computer Science - Computer Science and Game Theory, Computer Science and Game Theory (cs.GT)
FOS: Computer and information sciences, Computer Science - Computer Science and Game Theory, Computer Science and Game Theory (cs.GT)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 8 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
