Abstract.
Outranking methods constitute a class of ordinal ranking algorithms for multicriterion decision making. This paper is concerned with four such methods: Köhler’s primal and dual algorithms, and Arrow–Raynaud’s primal and dual algorithms. Arrow and Raynaud made the conjecture that these four methods yield the totality of “prudent orders” whenever the outranking matrix has the “constant sum” property. This paper shows that their conjecture is not valid.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: May 29, 1995/Accepted: November 13, 1995
Rights and permissions
About this article
Cite this article
Lansdowne, Z. Outranking methods for multicriterion decision making: Arrow’s and Raynaud’s conjecture. Soc Choice Welfare 14, 125–128 (1996). https://doi.org/10.1007/s003550050056
Issue Date:
DOI: https://doi.org/10.1007/s003550050056