We show that the Ranked Pairs Rule is equivalent to selecting the maximal linear orders with respect to a DiscriMin relation, which is a natural refinement of the Min relation used to define Arrow and Raynaud's prudent orders. We provide an axiomatic characterization of the Ranked Pairs Rule by building on an earlier characterization of the prudent order ranking rule. We conclude that a monotonicity criterion is the main distinction between the two ranking rules.
Page:
129-155
Related
Batch download
Cited By
noting
Similar Literature
Submit Feedback
Please wait while the file you selected is being converted