Before revision:  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 ).
After revision:  This leads to a novel algorithm, called FaSt, that finds the leximin optimal stable matching under ranked isometric valuations (where, for each pair of agents, the valuation of one agent for the other is the same ).