 Additionally, we provide an efficient algorithm, called FaSt-Gen, that finds the leximin optimal stable matching for ranked but otherwise unconstrained utilities .
<meaning-changed>  Additionally, we provide an efficient algorithm, called FaSt-Gen, that finds the leximin optimal stable matching for ranked but otherwise unconstrained utilities .
 Additionally, we provide an efficient algorithm, called FaSt-Gen, that finds the leximin optimal stable matching for ranked but otherwise unconstrained valuations .