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 A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, May 16, 2013, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Tillmann Miltzow (Freie Universität Berlin)

Counting Exchange Stable Matchings

(joint work with Balazs Keszegh and Andrei Asinowski) We are given two sets S,T with m and n elements respectively.(m much smaller n) Every member of S has a complete preference list over the members of T. An injective mapping from S to T is an exchange stable matching if there is no other matching, where at least one member s of S is assigned to a better 'partner' and no one is assigned to a worse 'partner'. We say a member t of T can be reached if there exists an exchange stable matching containing t. We show at most O( m log(m) ) many members of T can be reached. This bound is tight.

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

Previous talks by year:   2024  2023  2022  2021  2020  2019  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