| |
| | wiki/Ranked Pairs Definition / wiki/Ranked Pairs Research |
 | | 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). |
 | | Using the sorted list above, lock in each pair in turn unless the pair will create a circularity in a graph (e.g., where A is more than B, B is more than C, but C is more than A). |
 | | Let's say the candidates for the capital are Memphis (on the far west end), Nashville (in the center), Chattanooga (129 miles southeast of Nashville), and Knoxville (on the far east side, 114 northeast of Chattanooga). |
| www.elresearch.com /wiki/Ranked_Pairs (1135 words) |
|