BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260921T210816Z
UID:Seminar-EcCo-997@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Nicos 	Protopapas:MAILTO:N.Protopapas@liverpool.ac.uk
DTSTART:20210428T130000
DTEND:20210428T140000
SUMMARY:Economics and Computation Series
DESCRIPTION:Piotr Krysta: Efficient Truthful Scheduling and Resource Allocation through Monitoring\n\n We study the power and limitations of the Vickrey-Clarke-Groves mechanism with monitoring (VCGmon) for cost minimization problems with objective functions that are more general than the social cost. We identify a simple and natural sufficient condition for VCGmon to be truthful for general objectives. As a consequence, we obtain that for any cost minimization problem with non-decreasing objective \mu, VCGmon is truthful, if the allocation is Maximal-in-Range and \mu is 1-Lipschitz (e.g., \mu can be the L_p-norm of the agents' costs, for any p \geq 1 or p = \infty). We apply VCGmon to scheduling on restricted-related machines and obtain a polynomial-time truthful-in-expectation 2-approximate (resp. O(1)-approximate) mechanism for makespan (resp. L_p-norm) minimization. Moreover, applying VCGmon, we obtain polynomial-time truthful O(1)-approximate mechanisms for some fundamental bottleneck network optimization problems with single-parameter agents. On the negative side, we provide strong evidence that VCGmon could not lead to computationally efficient truthful mechanisms with reasonable approximation ratios for binary covering social cost minimization problems. However, we show that VCGmon results in computationally efficient approximately truthful mechanisms for binary covering problems.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=997
LOCATION:
END:VEVENT
END:VCALENDAR