BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1098
DTSTAMP:20230914T125950Z
SUMMARY:Fair Cake Division Under Monotone Likelihood Ratios
DESCRIPTION:Speaker: Siddharth Barman (Indian Institute of Science\nBangalo
 re)\n\nAbstract: \nThe cake-cutting problem provides a model for addressin
 g fair allocation of a divisible resource (metaphorically\, the cake) amon
 g agents with distinct preferences. Classic results of Stromquist (1980) a
 nd Su (1999) show that envy-free (fair) cake divisions are guaranteed to e
 xist under mild conditions. These strong existential results essentially f
 ollow from fixed-point theorems and stand without an algorithmic counterpa
 rt\; Stromquist (2008) has shown that an envy-free cake division with cont
 iguous pieces cannot be computed in bounded time. \n\nIn this talk I will 
 present a result which complements these existential (and non-constructive
 ) guarantees by way of developing efficient cake-cutting algorithms for a 
 broad class of valuations. In particular\, our algorithmic result holds wh
 en the agents' valuations are induced by linear translations of any log-co
 ncave function\, such as Gaussian\, exponential\, linear\, or binomial.\n\
 nJoint work with Nidhi Rathi. \n\nhttps://arxiv.org/abs/2006.00481\n\nhttp
 s://www.youtube.com/watch?v=uzc2ht4xPFU\n
URL:https://www.tcs.tifr.res.in/web/events/1098
DTSTART;TZID=Asia/Kolkata:20201110T160000
DTEND;TZID=Asia/Kolkata:20201110T170000
END:VEVENT
END:VCALENDAR