 In this paper , we explore the problem of finding a stable many-to-one matching  while satisfying fairness among the agents , having cardinal utilities. In particular, we focus on leximin optimal fairness and seek leximin optimal many-to-one stable matchings.
<meaning-changed>  In this paper , we explore the problem of finding a stable many-to-one matching  while satisfying fairness among the agents , having cardinal utilities. In particular, we focus on leximin optimal fairness and seek leximin optimal many-to-one stable matchings.
 In this paper , we explore the problem of finding a stable many-to-one matching while satisfying fairness among the agents on either side. Specifically, motivated by several real-world settings, we focus on leximin optimal fairness and seek leximin optimal many-to-one stable matchings.