BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//LORIA - ECPv6.15.18//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:LORIA
X-ORIGINAL-URL:https://www.loria.fr
X-WR-CALDESC:Évènements pour LORIA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20170326T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20171029T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20180325T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20181028T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20190331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20191027T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20181127T133000
DTEND;TZID=Europe/Paris:20181127T150000
DTSTAMP:20260405T042948
CREATED:20181113T160453Z
LAST-MODIFIED:20181119T095640Z
UID:6199-1543325400-1543330800@www.loria.fr
SUMMARY:Colloquium Loria : Claire Mathieu
DESCRIPTION:Claire Mathieu is the next speaker of Loria’s colloquium. \nShe will give a presentation entitled « Stable Matching in Practice » on Tuesday\, November 27th at 1:30 pm in the Amphitheater. \nAbstract \nStable matching methods\, based on the algorithm designed by Gale and Shapley\, are used around the world in many applications such as college admissions. Several criteria measure the quality of the result: number of students assigned; rank of the college assigned to the applicant in their preference list; robustness; running time; etc. \nAfter reviewing properties of the algorithm in the pure\, ideal setting\, we present issues arising in practice. The input data is uncertain and evolves with time\, so a one-shot algorithm does not suffice. It is not feasible for admission committees to meet continuously\, so the process cannot be fully dynamic. To reconcile those competing constraints\, a hybrid implementation proceeding partly online on the student side was recently proposed for college admissions in France. The system also incorporates side constraints on joint assignment to schools and to dorms. \nAbout the Speaker\nClaire Mathieu does research on the design and analysis of algorithms\, with a focus on approximation algorithms\, particularly approximation schemes for NP-hard problems. A former student of Ecole normale supérieure\, she received a PhD in Computer Science in 1988 at Paris-Sud University. She has held research and faculty positions at CNRS\, Paris-Sud University\, Ecole Polytechnique\, Brown University\, and Collège de France. She is currently a CNRS research director in Paris\, France. \n  \nTo attend the colloquium\, people from outside the laboratory may send an email to marie.baron (at) loria.fr before Friday\, November 23rd.
URL:https://www.loria.fr/event/colloquium-loria-claire-mathieu/
CATEGORIES:Séminaire
END:VEVENT
END:VCALENDAR