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:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf7dc9cfd20
DTSTART;TZID=America/Toronto:20240913T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240913T140000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-jacob-skitsko-1
SUMMARY:C&O Reading Group - Jacob Skitsko
CLASS:PUBLIC
DESCRIPTION:TITLE: Stable Matchings and a Matroid Generalization\n\nSPEAKER
 :\n Jacob Skitsko\n\nAFFILIATION:\n University of Waterloo\n\nLOCATION:\n 
 MC 6029\n\nABSTRACT: Today we'll continue our theme of matchings and talk 
 about\nstable matchings! We won't assume much previous experience with sta
 ble\nmatchings\, and we will (re)introduce what they are. After\, we will\
 ntalk about classic results and some more recent approximations for\ngener
 alizations of the problem. In the classic stable matching\nproblem\, we ar
 e given a bipartite graph and for each vertex we are\ngiven a list of stri
 ct preferences over other vertices. The goal is to\nfind a \"stable\" matc
 hing\, where no two vertices would prefer being\nmatched to other vertices
 . This can be accomplished using the classic\nGale-Shapley algorithm\, whi
 ch we will review. We will also consider\nwhen ties and indifferences can 
 be present in the list of preferences.\nWith such preferences\, the proble
 m becomes APX-Hard. However\, McDermid\nshowed it is possible to achieve a
  1.5 approximation. We will talk\nabout this\, and comment on a recent gen
 eralization to matroids from\nCsaji\, Kiraly\, and Yokoi.
DTSTAMP:20260403T084353Z
END:VEVENT
END:VCALENDAR