I've got one question for the people that know more about this ranked pairs system. I read this in the wikipedia article:
RP can also be used to create a sorted list of preferred candidates. To
create a sorted list, repeatedly use RP to select a winner, remove that
winner from the list of candidates, and repeat (to find the next runner
up, and so forth).
Does this mean that each iteration is only meaninful to determine the winner? Would the final results of the contest be different if we were to follow this procedure? I'm just asking, as I just don't really understand how this all works...
-Jorge