BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1144
DTSTAMP:20231128T111754Z
SUMMARY:A Computational Approach towards Incentives in Social Choice
DESCRIPTION:Speaker: Rohit Vaish\n\nAbstract: \nGroup decision-making is a 
 ubiquitous phenomenon with diverse applications ranging from political ele
 ctions to recommender systems and from organ exchanges to online marketpla
 ces. Social choice is a subfield of economics that provides a formal frame
 work for studying group decision-making procedures. Classically\, social c
 hoice theory has focused on establishing abstract results concerning the e
 xistence of procedures that provide the desired incentives to the particip
 ating agents. However\, in order to be practically applicable\, the mere e
 xistence of such procedures is not enough---efficient computation is impor
 tant as well. In this talk\, I will illustrate the role of computation in 
 shaping agents' incentives via a case study in fair division. Specifically
 \, I will talk about fair division of indivisible goods\, which is a relev
 ant model for assigning seats in university courses\, allocating public ho
 using units\, and inheritance division. I will present an algorithmic fram
 ework that combines the local search paradigm with the classical Fisher ma
 rket model from economics\, and simultaneously achieves the seemingly inco
 mpatible goals of fairness and economic efficiency. I will conclude with a
 n overview of my other work and future research directions. Bio: Rohit Vai
 sh is a visiting fellow at Tata Institute of Fundamental Research (TIFR). 
 Previously\, he was a postdoctoral researcher at Rensselaer Polytechnic In
 stitute (RPI) and\, prior to that\, received his PhD from Indian Institute
  of Science (IISc). His research is in computational social choice---a rap
 idly growing area at the intersection of theoretical computer science\, ar
 tificial intelligence\, and economics. He has worked on problems in voting
 \, matching\, fair division\, and learning theory\, and his research has b
 een published in top journals like Artificial Intelligence (AIJ) and premi
 er theory and AI conferences such as EC\, SODA\, AAAI\, IJCAI\, and NeurIP
 S among others. In addition\, he is a recipient of Prof. R Narasimhan post
 doctoral award at TIFR\, a best paper award nomination at AAMAS 2018\, and
  the INSPIRE faculty fellowship.\n
URL:https://www.tcs.tifr.res.in/web/events/1144
DTSTART;TZID=Asia/Kolkata:20210726T103000
DTEND;TZID=Asia/Kolkata:20210726T113000
END:VEVENT
END:VCALENDAR
