From Incomplete Preferences to Ranking via Optimization

Details From Incomplete Preferences to Ranking via Optimization From Incomplete Preferences to Ranking via Optimization

2006-02-24

arxiv.org/abs/math/0602552v1

A version of this paper was published as: P.Yu.Chebotarev, E.V.Shamis. Constructing an objective function for aggregating inco

Mathematics

Optimization and Control

25 pages, 6 figures

Scientific paper

We consider methods for aggregating preferences that are based on the resolution of discrete optimization problems. The preferences are represented by arbitrary binary relations (possibly weighted) or incomplete paired comparison matrices. This incomplete case remains practically unexplored so far. We examine the properties of several known methods and propose one new method. In particular, we test whether these methods obey a new axiom referred to as {\it Self-Consistent Monotonicity}. Some results are established that characterize solutions of the related optimization problems.

Affiliated with

Also associated with

No associations

Rating

From Incomplete Preferences to Ranking via Optimization 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 From Incomplete Preferences to Ranking via Optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and From Incomplete Preferences to Ranking via Optimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-224158