条件偏好网(CP-Nets)的可满足性序列是由决策者的偏好信息得到的一个关于所有配置的排序表,其中偏好关系具有不完备性和传递性.主要分析借鉴传统的表决策略来实现CP-Nets的可满足性序列的聚合的可行性,介绍“少数服从多数”和“与位置相关”策略在CP-Nets的可满足性序列的聚合的具体实现并进行性能分析.实现传统表决系统的一个从完备到非完备的推广应用.
The satisfactory ranking for conditional preference networks (CP-Nets) is a ranking of all outcomes acquired from preferences of decision maker, and its preference relation is incomplete feasibility on aggregation of satisfactory rankings for CP-Nets with traditional voting The detailed realizations and performance analysis on aggregation of satisfactory and transitive. The system is analyzed. rankings with the majority rule and positional voting are individually introduced. So it realizes the promotion and application of voting system from completeness to non-completeness.