The paper develops a new extension of the sequential preference condition, which leads to unique stable matching in all subpopulations, obtained by consistent restrictions of the marriage matching problem. Under the new condition, the Gale–Shapley algorithm is stable, consistent, strategy-proof, Pareto optimal for men, and Pareto optimal for women.