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

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.

MoreLess

Year of publication:	1996
Authors:	Lansdowne, Zachary F.
Published in:	Social Choice and Welfare. - Springer. - Vol. 14.1996, 1, p. 125-128
Publisher:	Springer

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf application/postscript
Type of publication:	Article
Notes:	Received: May 29, 1995/Accepted: November 13, 1995
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005369496