Before revision:  We then establish that, in the absence of rankings, finding a leximin optimal stable matching is NP-Hard, even under isometric utilities .
After revision:  We next establish that, in the absence of rankings, finding a leximin optimal stable matching is NP-Hard, even under isometric utilities .