BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:Existence of Fair and Efficient Allocation of Indivisible Chores [
 Oberseminar Discrete Optimization]
DTSTART:20251013T160000Z
DTEND:20251013T170000Z
DTSTAMP:20260317T145200Z
UID:indico-event-647@math-events.uni-bonn.de
DESCRIPTION:Speakers: Ryoga Mahara (University of Tokyo)\n\nWe study the p
 roblem of allocating indivisible chores among agents with additive cost fu
 nctions in a fair and efficient manner. A major open question in this area
  is whether there always exists an allocation that is envy-free up to one 
 chore (EF1) and Pareto optimal (PO). In this talk\, I will present a posit
 ive answer to this question by proving the existence of such an allocation
  under additive cost functions. Our proof is based on a novel combination 
 of a fixed-point argument and a discrete algorithm\, which provides a sign
 ificant methodological advance in this area.\nOur additional key contribut
 ions are as follows. We show that there always exists an allocation that i
 s EF1 and fractional Pareto optimal (fPO)\, where fPO is a stronger effici
 ency concept than PO. We also show that an EF1 and PO allocation can be co
 mputed in polynomial time when the number of agents is constant. Finally\,
  we extend all of these results to the more general setting of weighted EF
 1 (wEF1)\, which accounts for agents’ entitlements.\n \nThe Oberseminar
  takes place in the Seminarraum\, 1st floor. Participants are invited to h
 ave coffee or tea in the lounge before.\n \n\nhttps://math-events.uni-bon
 n.de/event/647/
LOCATION:Arithmeum\, Lennéstr.\,  2 - Seminarraum (Arithmeum / Research I
 nstitute for Discrete Mathematics)
URL:https://math-events.uni-bonn.de/event/647/
END:VEVENT
END:VCALENDAR