Predavatelj: Marcin Anholcer (Poznań University of Economics and Business, Poljska)

Povzetek:  Gale and Shapley (1962) showed that for two sets of agents who have preferences for agents in the second set, one can always find a stable matching, and even that it can be done in polynomial time. Knuth (1976) asked whether this feature was also shared by settings in which there are at least three groups of agents. It soon turned out that not always. Since then, many have wondered what kind of system of preferences guarantees the existence of a stable matching. During the presentation, I will tell you about these considerations.

 

Accessibility