Invited Talk by Dr. Sushmita Gupta on Multivariate Analysis of Hard Variants of Stable Marriage Problem
The stable marriage problem is a classic problem that is used in practice to model wide ranging scenarios such as matching colleges to students, kidney donors to recipients, users to servers in a distributed internet service etc There is a polynomial time algorithm for computing a solution for the problem that is attributed to Gale and Shapley. However, there are several natural variants of the stable marriage problem that are NP-hard. In this talk we will be discussing hard variants of the stable marriage problem from the perspective of Parameterized Complexity.
Dr. Sushmita Gupta is a postdoctoral researcher at the University of Bergen, Norway. Prior to this, she was a postdoc at University of Kyoto. She got her Bachelors, Masters and PhD degrees from Chennai Mathematical Institute, Simon Fraser University and University of Southern Denmark respectively.