BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1478
DTSTAMP:20241112T094213Z
SUMMARY:Some Non-Recent Advances in Understanding the Complexity of Incenti
 ve Compatible Mechanisms
DESCRIPTION:Speaker: Shahar Dobzinski (Weizmann Institute of Science)\n\nAb
 stract: \nHow powerful are incentive-compatible polynomial-time algorithms
  compared to polynomial-time algorithms that are not necessarily incentive
 -compatible? This question stands at the heart of Algorithmic Mechanism De
 sign and has been extensively studied. This talk will take the form of a s
 urvey. We will discuss how to construct good incentive-compatible polynomi
 al time algorithms and how to prove bounds on their power.\nShort Bio: Sha
 har Dobzinski is a faculty member in the Department of Applied Mathematics
  and Computer Science at the Weizmann Institute of Science. His primary re
 search interests center on algorithmic game theory\, focusing on the inter
 section of algorithms\, incentives\, and strategic behavior in computation
 al environments.\n \n
URL:https://www.tcs.tifr.res.in/web/events/1478
DTSTART;TZID=Asia/Kolkata:20241119T160000
DTEND;TZID=Asia/Kolkata:20241119T170000
LOCATION:via Zoom in A201
END:VEVENT
END:VCALENDAR