arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1207.1377cs.AI
收藏

可能性案例推理中定性期望效用估计的有效算法

Efficient algorithm for estimation of qualitative expected utility in possibilistic case-based reasoning

Swinburne University of Technology(斯威本科技大学)

Jakub Brzostowski, Ryszard Kowalczyk

摘要:

我们提出了一个有效的算法估计的可能性为基础的定性期望效用。它对决策机制很有用,其中每个可能的决策都被分配了一个多属性可能性分布。基于离散化计算期望效用的普通方法的计算复杂性随着属性的数量呈指数增长,并且可能在这些属性的数量很高时变得不可行。我们提出了一系列定理和引理证明我们的算法的正确性,具有线性计算复杂性。我们的算法已被应用于选择最有前途的合作伙伴在多方多属性谈判的背景下,也可以用于决策过程中的潜在报价作为其他类似的问题。

英文摘要:

We propose an efficient algorithm for estimation of possibility based qualitative expected utility. It is useful for decision making mechanisms where each possible decision is assigned a multi-attribute possibility distribution. The computational complexity of ordinary methods calculating the expected utility based on discretization is growing exponentially with the number of attributes, and may become infeasible with a high number of these attributes. We present series of theorems and lemmas proving the correctness of our algorithm that exibits a linear computational complexity. Our algorithm has been applied in the context of selecting the most prospective partners in multi-party multi-attribute negotiation, and can also be used in making decisions about potential offers during the negotiation as other similar problems.

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

↑