期刊文献+

有限策略集全序解及其生成算法

Total order solution of a finite strategy set and its generating algorithm
下载PDF
导出
摘要 根据策略之间的两两比较结果,将策略集中的所有策略排出顺序是人们在决策时的一个基本依据。本文提出最小全序解的概念,并分别给出偏序策略集、预序策略集以及任意关系策略集最小全序解的表示及其生成算法。 All strategies in the strategy set are sorted according to the comparison results between strategies,which is a fundamental basis for people to make decision.This paper proposes the concept of minimal total order solution,and provides the representations and generating algorithms of the minimal total order solutions of strategy sets with partial order,pre-order and arbitrary relation,respectively.
出处 《武汉科技大学学报》 CAS 北大核心 2016年第4期317-320,共4页 Journal of Wuhan University of Science and Technology
基金 湖北省自然科学基金资助项目(2013CFA131)
关键词 策略集 最小全序解 偏序关系 全序关系 决策 strategy set minimal total order solution partial order relation total order relation decision making
  • 相关文献

参考文献3

  • 1Katsikopoulos K V, Gigerenzer G. One-reason deci- sion-making: modeling violations of expected utility theory[J]. Journal of Risk and Uncertainty, 2008, 37(1) :35-56.
  • 2Andreoni J, Sprenger C. Certain and uncertain utili- ty:the Allais Paradox and five decision theory phe- nomena[Z]. Levine s Working Paper Archive, 2010 .. 1-20.
  • 3Wong SK M, Yao Y Y, Bollmann P, et al. Axi- omatization of qualitative belief structures[J]. IEEE Transactions on Systems, Man and Cybernetics, 1991, 21(4) ..726-734.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部