Article thumbnail

Outranking methods for multicriterion decision making: Arrow's and Raynaud's conjecture

By Zachary F. Lansdowne


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.

OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.