Balanced Stable Marriage (BSM) is a central optimization version of the classic (SM) problem. We study BSM from viewpoint Parameterized Complexity. Informally, input consists n men, women, and an integer k. Each person has (sub)set acceptable partners, A(a), whom ranks strictly; we use pa(b) to denote position b∈A(a) in a's preference list. The objective decide whether there exists stable match...
