Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, October 22, 2009, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Stefan Schneider
One of the first standard problems to introduce somebody to combinatorial algorithms might well be the Stable Matching or Stable Marriage Problem (e.g., see Kleinberg and Tardos' book "Algorithm Design"). Given n men and n women each of them with a preference list what will happen during a party? Is there a stable matching meaning that no two of them prefer each other to their current partner? As we know the answer is yes and the classical algorithm by Gale and Shapley (1962) always finds a stable matching. If we allow incomplete preference lists and ties, the situation becomes more complicated. Then, it is still possible to find a stable matching in linear time, but some men and women might be without partner at the end. The problem to find a stable matching of maximum size is known to be NP-hard. This paper describes the latest improvements in this field giving better (and as the author claims simpler) approximation algorithms for this problem.
Paper by Zoltán Király: Better and simpler approximation algorithms for the stable marriage problem, ESA 2008.
Automatic MiSe System Software Version 1.4803M | admin login