BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1735
DTSTAMP:20260619T105657Z
SUMMARY:Introspectively Envy-Free and Efficient Allocation of Indivisible M
 ixed Manna
DESCRIPTION:Speaker: Paritosh Verma (University of Toronto)\n\nAbstract: \n
 The existence of allocations that are simultaneously fair and efficient is
  a central inquiry in the fair division literature. A prominent result in 
 discrete fair division shows that the complementary desiderata of fairness
  and efficiency can be achieved together when allocating indivisible items
  with nonnegative values\; specifically\, allocations that are both envy-f
 ree up to one item (EF1) and Pareto efficient (PO) always exist for indivi
 sible goods and additive valuations. While a recent breakthrough extends t
 he EF1 and PO guarantee to indivisible chores (items with negative values)
 \, the question remains open for indivisible mixed manna\, where values ca
 n be positive\, negative\, or zero.The talk will describe our recent work 
 that makes notable progress in resolving this central question. For indivi
 sible mixed manna and additive valuations\, we establish the existence of 
 allocations that are PO and introspectively envy-free up to one item (IEF1
 ). In an IEF1 allocation\, each agent can eliminate its envy towards all t
 he other agents by either adding an item or removing an item from its own 
 bundle. The notion of IEF1 coincides with EF1 for indivisible chores\, and
  hence\, our result generalizes the aforementioned existence guarantee for
  chores. Our techniques can be adopted to obtain an alternative proof for 
 (in fact a generalization of) the existence of EF1 and PO allocations of i
 ndivisible goods\, as well as recover a distinct proof for the existence o
 f PO and envy-free allocations of divisible mixed manna.\nHence\, our resu
 lts provide a unified approach that subsumes several state-of-the-art exis
 tence results concerning fair and efficient allocation of both indivisible
  and divisible items.\nBased on joint work with Dr. Siddharth Barman (IISc
 )\n
URL:https://www.tcs.tifr.res.in/web/events/1735
DTSTART;TZID=Asia/Kolkata:20260624T160000
DTEND;TZID=Asia/Kolkata:20260624T170000
LOCATION:via Zoom in A201
END:VEVENT
END:VCALENDAR