Before revision:  We present a novel and efficient algorithm that finds the leximin optimal stable matching under ranked isometric utilities .
After revision:  This leads to a novel algorithm, called FaSt, that finds the leximin optimal stable matching under ranked isometric utilities .