Abraham et al. [1]} showed that the problem of finding a matching that has as few blocking pairs as possible is also NP-hard. Chen et al. showed that the problem is W[1]-hard with respect the number of blocking pairs [2]}.
