arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv math/0602171math.OCcs.MAmath.CO
收藏

选项数超过2时的偏好融合:间接评分法

Preference fusion when the number of alternatives exceeds two: indirect scoring procedures

Pavel Chebotarev, Elena Shamis

摘要:

本文研究了由任意二元关系或不完全配对比较矩阵表示的不完全偏好的集结问题。对于一些间接评分程序,我们研究它们是否满足自洽单调性公理。介绍了{ \em输赢组合计分程序}类,它包含了大多数已知计分程序。两个主要结果成立。根据第一种方法,每一个输赢组合评分过程都打破了自洽单调性。第二个结果提供了满足自洽单调性的一个充分条件。

英文摘要:

We consider the problem of aggregation of incomplete preferences represented by arbitrary binary relations or incomplete paired comparison matrices. For a number of indirect scoring procedures we examine whether or not they satisfy the axiom of self-consistent monotonicity. The class of {\em win-loss combining scoring procedures} is introduced which contains a majority of known scoring procedures. Two main results are established. According to the first one, every win-loss combining scoring procedure breaks self-consistent monotonicity. The second result provides a sufficient condition of satisfying self-consistent monotonicity.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑