BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1499
DTSTAMP:20250110T044418Z
SUMMARY:Constant-Factor EFX Exists for Chores
DESCRIPTION:Speaker: Jugal Garg (Univ. of Illinois at Urbana-Champaign)\n\n
 Abstract: \nFair division is an age-old problem that deals with the alloca
 tion of items among agents with diverse preferences in a fair and efficien
 t way. It naturally arises in various real-life situations\, from interper
 sonal to international conflicts. In the discrete setting\, envy-freeness 
 up to any item (EFX) has emerged as a compelling fairness criterion\, thou
 gh its existence remains one of the most important open problems in fair d
 ivision. In this talk\, I will present recent advances in the fair allocat
 ion of indivisible chores\, focusing on the first constant-factor approxim
 ation of EFX\, achieved through the novel concept of earning-restricted co
 mpetitive equilibrium.\n \nThis talk is based on joint work with Aniket M
 urhekar and John Qin\, available at https://arxiv.org/abs/2407.03318\n \
 nShort Bio: \nJugal Garg is an associate professor of Industrial and Enter
 prise Systems Engineering and an affiliate associate professor of Siebel S
 chool of Computing and Data Science at the University of Illinois at Urban
 a-Champaign. Jugal's research studies algorithms and complexity for some o
 f the most fundamental problems in economics and computation\, with a part
 icular focus on allocation problems arising in fair division and general e
 quilibrium theory. He has received several awards for his research\, inclu
 ding the NSF CAREER Award\, the Exemplary Theory Paper Award at ACM EC 202
 0\, the INFORMS Koopman Prize 2021\, and the Dean's Award for Excellence i
 n Research 2022. \n
URL:https://www.tcs.tifr.res.in/web/events/1499
DTSTART;TZID=Asia/Kolkata:20250114T160000
DTEND;TZID=Asia/Kolkata:20250114T170000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR