Characterizations of scoring methods for preference aggregation

Details Characterizations of scoring methods for preference aggregation Characterizations of scoring methods for preference aggregation

2006-02-23

arxiv.org/abs/math/0602522v1

Annals of Operations Research, 1998. V. 80. P.299-332

Mathematics

Optimization and Control

33 pages; with tables and figures

Scientific paper

The paper surveys more than forty characterizations of scoring methods for preference aggregation and contains one new result. A general scoring operator is {\it self-consistent} if alternative $i$ is assigned a greater score than $j$ whenever $i$ gets no worse (better) results of comparisons and its `opponents' are assigned respectively greater (no smaller) scores than those of $j$. We prove that self-consistency is satisfied if and only if the application of a scoring operator reduces to the solution of a homogeneous system of algebraic equations with a monotone function on the left-hand side.

Affiliated with

Also associated with

No associations

Rating

Characterizations of scoring methods for preference aggregation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Characterizations of scoring methods for preference aggregation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Characterizations of scoring methods for preference aggregation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-711682