BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260409T175637Z
UID:Seminar-EcCo-625@lxserverA.csc.liv.ac.uk.csc.liv.ac.uk
ORGANIZER:CN=Nicos 	Protopapas:MAILTO:N.Protopapas@liverpool.ac.uk
DTSTART:20200311T130000
DTEND:20200311T140000
SUMMARY:Economics and Computation Series
DESCRIPTION:Giorgos Christodoulou: Truthful Graph Balancing\n\nWe study truthful mechanisms for the Unrelated Graph Balancing problem. This is the special case of the well-studied unrelated machines scheduling problem, in which every given task can be executed only by two pre-specified machines. This corresponds to a multigraph whose nodes are the machines and its edges are the tasks. We provide upper and lower bounds for incentive compatible\nmechanisms for general multigraphs, as well as special classes of graphs such as stars, trees, planar graphs, k-degenerate graphs, and graphs of a given treewidth.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=625
LOCATION:
END:VEVENT
END:VCALENDAR