Definition 8 ([1]}) 
A generous stable matching is a stable matching \(M\)  whose reverse profile, denoted \(p_R(M)\)  is lexicographically minimum over all the stable matchings of \(I\) . In other words, it first minimises the number of \(n^{th}\)  choices, then the number of \((n-1)^{th}\)  choices, and so on, where \(n\)  is the number of agents.

