BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260921T210816Z
UID:Seminar-EcCo-973@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Nicos 	Protopapas:MAILTO:N.Protopapas@liverpool.ac.uk
DTSTART:20201211T130000
DTEND:20201211T140000
SUMMARY:Economics and Computation Series
DESCRIPTION:Giorgios Christodoulou: On the Nisan-Ronen conjecture\n\nThe Nisan-Ronen conjecture states that no truthful mechanism for makespan-minimization\n\n\n\nwhen allocating m tasks to n unrelated machines can have approximation ratio less than n.\n\n\n\nOver more than two decades since its formulation, little progress has been made in resolving\n\n\n\nit and the best known lower bound is still a small constant. In this talk we will discuss recent progress\n\n\n\ntowards validating the conjecture.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=973
LOCATION:
END:VEVENT
END:VCALENDAR