Kommentar |
The classical Stable Matching problem is to decide whether there exists a matching of agents such that no two agents which are not matched to each other would prefer to be with each other rather than with their respectively assigned partners. Relevant variants range from the Bipartite case (historically called Stable Marriage) to College Admission and Kidney Exchange models. While many award-winning results and algorithms go back to the 1960s, there was considerable progress and the last decade that will be discussed in this seminar.
On successful completion, students will be able to: - overview a current topic in the field of Stable Matching from a theoretical or applied perspective - familiarize themselves with a scientific paper, and - present their topic in oral and written form to a group of non-experts. |