 This leads to a novel algorithm, called FaSt, that finds the leximin optimal stable matching under ranked isometric utilities (wherethe utilities from matching are the same across an edge ).
<clarity>  This leads to a novel algorithm, called FaSt, that finds the leximin optimal stable matching under ranked isometric utilities (wherethe utilities from matching are the same across an edge ).
 This leads to FaSt, a novel and efficient algorithm to compute a leximin optimal stable matching under ranked isometric utilities (wherethe utilities from matching are the same across an edge ).