BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20201101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:683096aca0274
DTSTART;TZID=America/Toronto:20210604T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20210604T153000
URL:/combinatorics-and-optimization/events/tutte-colloq
 uium-kanstantsin-pashkovich-1
SUMMARY:Tutte Colloquium - Kanstantsin Pashkovich
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: On the approximability of the maximum cardi
 nality stable\nmatching problem with ties  \n\nSpeaker:\n Kanstantsin Pas
 hkovich\n\nAffliliation:\n University of À¶Ý®ÊÓƵ\n\nZoom:\n Contact Emma
  Watson\n\nABSTRACT:\n\nThe maximum cardinality stable matching problem is
  central in game\ntheory. When participants are allowed to have ties in th
 eir\npreferences\, the problem of finding a stable matching of maximum\nca
 rdinality is NP-hard\, even when the ties are of size two. Moreover\,\nin 
 this setting it is UGC-hard to provide an approximation for the\nmaximum c
 ardinality stable matching problem with a constant factor\nsmaller than 4/
 3.\n 
DTSTAMP:20250523T153924Z
END:VEVENT
END:VCALENDAR