Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, October 22, 2009, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Stefan Schneider

The Stable Marriage Problem (student talk, 45 min.)

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login