Characterizations of scoring methods for preference aggregation

Simple item page
dc.creatorChebotarev, Pavel
dc.creatorShamis, Elena
dc.date2006-02-23
dc.date.accessioned2026-07-07T07:03:42Z
dc.date.available2026-07-07T07:03:42Z
dc.descriptionThe 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.
dc.description33 pages; with tables and figures
dc.identifierhttps://arxiv.org/abs/math/0602522
dc.identifierhttp://arxiv.org/abs/math/0602522
dc.identifierAnnals of Operations Research, 1998. V. 80. P.299-332
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/109077
dc.subjectOptimization and Control
dc.subjectMultiagent Systems
dc.subjectFunctional Analysis
dc.subject91B08; 91B10; 91B12; 91B16
dc.titleCharacterizations of scoring methods for preference aggregation
dc.typetext

Files

Collections

arXiv