BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: Stable matchings are well-studied from computer science\, math
 ematics\, and economics. In the most basic setting\, called Stable Marriage
 \, there are two sets of agents. Each agent from one set has preferences ov
 er the agents from the other set. A matching assigns the agents into groups
  of two agents. A matching is called stable if there are no two agents pref
 erring each other to the partners assigned to them. In this talk\, we will 
 review important parts of my forthcoming PhD thesis concerning the computat
 ional complexity of two extensions of this basic model: First\, we assume t
 hat an instance of Stable Marriage is given\, and the aim is to modify the 
 instance (using as few "modifications" as possible) such that a given edge 
 is part of some stable matching. Second\, we assume that agents have prefer
 ences over sets of d-1 other agents (for some d&gt\;2). In this case\, a ma
 tching matches agents into groups of size d\, and a matching is stable if t
 here are no d agents preferring to be matched together to being unmatched. 
 While since 1991 this problem is known to be NP-complete\, we study the cas
 e that the preferences of all agents are "similar". 
DTSTAMP:20220124T205500
DTSTART:20220131T160000
CLASS:PUBLIC
LOCATION:Online via Zoom.
SEQUENCE:0
SUMMARY:Klaus Heeger (Technische Universität Berlin): Stable Matchings Beyo
 nd Stable Marriage
UID:107920073@/www.mi.fu-berlin.de
URL:https://www.mi.fu-berlin.de/en/facetsofcomplexity/monday/20220131-C-Hee
 ger.html
END:VEVENT
END:VCALENDAR