On the nisan-ronen conjecture-Reference-Cited by-同舟云学术

On the nisan-ronen conjecture

Published:2022-07 Issue:1 Volume:20 Page:41-46
ISSN:1551-9031
Container-title:ACM SIGecom Exchanges
language:en
Short-container-title:SIGecom Exch.

Author:

Christodoulou George¹,Koutsoupias Elias²,Kovacs Annamaria³

Affiliation:

1. Aristotle University of Thessaloniki

2. University of Oxford

3. Goethe University

Abstract

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 bound was a small constant. This note gives an overview of our recent paper that gives a lower bound of [EQUATION].

Publisher

Association for Computing Machinery (ACM)

Subject

Geriatrics and Gerontology

Link

https://dl.acm.org/doi/pdf/10.1145/3572885.3572888

Reference15 articles.

1. Archer A. and Kleinberg R. 2008. Truthful germs are contagious: a local to global characterization of truthfulness. In EC. ACM 21--30. Archer A. and Kleinberg R. 2008. Truthful germs are contagious: a local to global characterization of truthfulness. In EC. ACM 21--30.

2. Weak Monotonicity Characterizes Deterministic Dominant-Strategy Implementation

3. Mechanism design for fractional scheduling on unrelated machines

4. Christodoulou G. Koutsoupias E. and Kovács A. 2020. On the Nisan-Ronen conjecture for submodular valuations. In STOC. ACM 1086--1096. (Full version arXiv:1907.12733). Christodoulou G. Koutsoupias E. and Kovács A. 2020. On the Nisan-Ronen conjecture for submodular valuations. In STOC. ACM 1086--1096. (Full version arXiv:1907.12733).

5. Christodoulou G. Koutsoupias E. and Kovács A. 2021a. On the Nisan-Ronen conjecture. In FOCS. IEEE 839--850. Christodoulou G. Koutsoupias E. and Kovács A. 2021a. On the Nisan-Ronen conjecture. In FOCS. IEEE 839--850.