Definition 7 ([1]}) 
A rank-maximal matching is a stable matching whose profile is lexicographically maximum over all the stable matchings of I. In other words, it first maximises the number first choices, then the number of second choices, and so on.

