A proof of the Nisan-Ronen conjecture

01/27/2023

∙

Noam Nisan and Amir Ronen conjectured that the best approximation ratio of deterministic truthful mechanisms for makespan-minimization for n unrelated machines is n. This work validates the conjecture.

READ FULL TEXT

A proof of the Nisan-Ronen conjecture

A Proof of the Kahn-Kalai Conjecture

On the Nisan-Ronen conjecture

Computational irreducibility and compatibilism: towards a formalization

Proof of a conjecture of Krawchuk and Rampersad

A New Conjecture on Hardness of Low-Degree 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems

A Proof of the Weak Simplex Conjecture

On some batch code properties of the simplex code

A proof of the Nisan-Ronen conjecture

Related Research

A Proof of the Kahn-Kalai Conjecture

On the Nisan-Ronen conjecture

Computational irreducibility and compatibilism: towards a formalization

Proof of a conjecture of Krawchuk and Rampersad

A New Conjecture on Hardness of Low-Degree 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems

A Proof of the Weak Simplex Conjecture

On some batch code properties of the simplex code