BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1451
DTSTAMP:20240711T102852Z
SUMMARY:Matchings and Popularity
DESCRIPTION:Speaker: Kavitha  Telikepalli (TIFR)\n\nAbstract: \nThe problem
  of computing a stable matching in a bipartite graph is an old and well-st
 udied problem. Gale and Shapley showed in 1962 that such a matching always
  exists and can be efficiently computed. This is a classical result in alg
 orithms with many applications in economics and computer science. Stabilit
 y is a strong and rather restrictive notion. This talk will be on a relaxa
 tion of stability called ‘popularity’ and we will see simple and effic
 ient algorithms for some popular matching problems. No background in algor
 ithms or matching theory will be assumed.\nShort Bio:\nKavitha is professo
 r at the School of Technology and Computer Science at TIFR Mumbai and s
 he is also the dean of our school. Prior to joining TIFR\, she was a facul
 ty at the Indian Institute of Science (Bengaluru) and a postdoc at Max-Pla
 nck Institute for Informatics\, Saarbrücken. Her primary interests are in
  the graph algorithms and combinatorial optimisation\, and has made founda
 tional contributions in the area of graph matchings.\n
URL:https://www.tcs.tifr.res.in/web/events/1451
DTSTART;TZID=Asia/Kolkata:20240715T160000
DTEND;TZID=Asia/Kolkata:20240715T170000
LOCATION:AG-66
END:VEVENT
END:VCALENDAR