.png){kind=icon}
返回
An interactive algorithm for multiobjective ranking for underlying linear and quasiconcave value functions
.png){kind=icon}
OA
AI
DOI：10.1111/itor.12704.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We develop interactive algorithms to find a strict total order for a set of discrete alternatives for two different value functions: linear and quasiconcave. The algorithms first construct a preference matrix and then find a strict total order. Based on the ordering, they select a meaningful pair of alternatives to present the decision maker (DM) for comparison. We employ methods to find all implied preferences of the DM, after he or she makes a preference. Considering all the preferences of the DM, the preference matrix is updated and a new strict total order is obtained until the termination conditions are met. We test the algorithms on several instances. The algorithms show fast convergence to the exact total order for both value functions, and eliciting preference information progressively proves to be efficient.
Keyword:
interactive
strict total order
discrete alternative
convex cone
multiple criteria
transitivity
linear value function
quasiconcave value function
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.9
论文数:
1.8K
被引数:
3.7K
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容