BEGIN:VCALENDAR
VERSION:2.0
X-WR-CALNAME;VALUE=TEXT:Fair allocation of indivisible chores via earning-restricted equilibria 
PRODID:-//Harvard events data//EN
BEGIN:VEVENT
UID:event_1877581_0
SUMMARY:Fair allocation of indivisible chores via earning-restricted equilibria 
DESCRIPTION:<p>	<strong>Abstract</strong>: Fair division is an age-old problem that deals with the allocation of items among agents with diverse preferences in a fair and efficient way. It naturally arises in various real-life situations, from interpersonal to international conflicts. In the discrete setting, envy-freeness up to any item (EFX) has emerged as a compelling fairness criterion, though its existence remains one of the most important open problems in fair division. In this talk, I will present recent advances in the allocation of indivisible chores, focusing on the first constant-factor approximation of EFX, achieved through the novel concept of earning-restricted competitive equilibrium. This is based on joint work with Jugal Garg and John Qin (<a href="https://arxiv.org/abs/2407.03318">https://arxiv.org/abs/2407.03318</a>).</p>
LOCATION:SEC 1.413
STATUS:CONFIRMED
DTSTART:20241011T173000Z
DTEND:20241011T183000Z
END:VEVENT
END:VCALENDAR