From Incomplete Preferences to Ranking via Optimization

Simple item page
dc.creatorChebotarev, Pavel
dc.creatorShamis, Elena
dc.date2006-02-24
dc.date.accessioned2026-07-07T07:03:45Z
dc.date.available2026-07-07T07:03:45Z
dc.descriptionWe 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.
dc.description25 pages, 6 figures
dc.identifierhttps://arxiv.org/abs/math/0602552
dc.identifierhttp://arxiv.org/abs/math/0602552
dc.identifierA version of this paper was published as: P.Yu.Chebotarev, E.V.Shamis. Constructing an objective function for aggregating incomplete preferences, In: A.Tangian and J.Gruber, eds. Econometric Decision Models: Constructing Scalar-Valued Objective Functions. Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, 1997, P.100-124
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/109097
dc.subjectOptimization and Control
dc.subjectMultiagent Systems
dc.subjectCombinatorics
dc.subject91B10; 90C35; 90C27; 91B08; 90B80
dc.titleFrom Incomplete Preferences to Ranking via Optimization
dc.typetext

Files

Collections

arXiv