BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:Constant-Factor EFX Exists for Chores [Oberseminar Discrete Optimi
 zation]
DTSTART:20250331T161500Z
DTEND:20250331T171500Z
DTSTAMP:20260305T165500Z
UID:indico-event-283@math-events.uni-bonn.de
DESCRIPTION:Speakers: Jugal Garg (University of Illinois Urbana Champaign)
 \n\nFair division is an age-old problem that deals with the allocation of 
 items among agents with diverse preferences in a fair and efficient way. I
 t naturally arises in various real-life situations\, from interpersonal to
  international conflicts. In the discrete setting\, envy-freeness up to an
 y item (EFX) has emerged as a compelling fairness criterion\, though its e
 xistence remains one of the most important open problems in fair division.
  In this talk\, I will present recent advances in the fair allocation of i
 ndivisible chores\, focusing on the first constant-factor approximation of
  EFX\, achieved through the novel concept of earning-restricted competitiv
 e equilibrium. \n \nThis talk is based on joint work with Aniket Murhekar
  and John Qin\, available  at https://arxiv.org/abs/2407.03318.\n \nThe 
 Oberseminar takes place in the Seminarraum\, 1st floor. Participants are i
 nvited to have coffee or tea in the lounge before.\n \n\nhttps://math-eve
 nts.uni-bonn.de/event/283/
LOCATION:Arithmeum\, Lennéstr.\,  2 - Seminarraum (Arithmeum / Research I
 nstitute for Discrete Mathematics)
URL:https://math-events.uni-bonn.de/event/283/
END:VEVENT
END:VCALENDAR