Definition 14 [1]}
An almost-stable matching is a matching (not necessarily stable) that admits the fewest number of blocking pairs across all the possible matchings of \(I\) . If \(I\)  admits a stable matching, then it is also always an almost-stable matching, as it has 0 blocking pairs.

