A Distance-Based Collective Weak Ordering
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
An axiomatic structure relating to the concept of distance between binary relations is developed and an algorithm for deriving the collective weak ordering is proposed, based on the idea of ranking first the least dominated alternatives.
Abstract
Abstract A group decision-making approach can be seen as a two stage process. The first stage allows for multi-cirteria evaluation of the alternatives and the second aims at deriving a collective weak ordering from the partial orderings supplied by the members after the first stage. The problem of combining the weak orderings to form a collective ranking is investigated. An axiomatic structure relating to the concept of distance between binary relations is developed. An algorithm for deriving the collective weak ordering is proposed, based on the idea of ranking first the least dominated alternatives.