AI Chat AI Image Generator AI Video Text to Speech

On the Nisan-Ronen conjecture

11/29/2020

∙

by George Christodoulou, et al.

∙

∙

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 is still a small constant. This work makes progress towards validating the conjecture by showing a lower bound of 1+√(n-1).

George Christodoulou
13 publications
Elias Koutsoupias
14 publications
Annamaria Kovacs
4 publications

page 1

page 2

page 3

page 4

research

∙ 01/27/2023

A proof of the Nisan-Ronen conjecture

Noam Nisan and Amir Ronen conjectured that the best approximation ratio ...

0 George Christodoulou, et al. ∙

research

∙ 01/26/2023

A New Lower Bound in the abc Conjecture

We prove that there exist infinitely many coprime numbers a, b, c with a...

0 Curtis Bright, et al. ∙

research

∙ 02/10/2021

A better lower bound for Lower-Left Anchored Rectangle Packing

Given any set of points S in the unit square that contains the origin, d...

0 Ruben Hoeksma, et al. ∙

research

∙ 07/10/2018

The Kannan-Lovász-Simonovits Conjecture

The Kannan-Lovász-Simonovits conjecture says that the Cheeger constant o...

0 Yin Tat Lee, et al. ∙

research

∙ 11/04/2021

The discrepancy of unsatisfiable matrices and a lower bound for the Komlós conjecture constant

We construct simple, explicit matrices with columns having unit ℓ^2 norm...

0 Dmitriy Kunisky, et al. ∙

research

∙ 07/30/2019

On the Nisan-Ronen conjecture for submodular valuations

We consider incentive compatible mechanisms for a domain that is very cl...

0 George Christodoulou, et al. ∙

research

∙ 03/26/2023

The Subspace Flatness Conjecture and Faster Integer Programming

In a seminal paper, Kannan and Lovász (1988) considered a quantity μ_KL(...

0 Victor Reis, et al. ∙