Decision with belief functions and generalized independence: Two impossibility theorems1

IF 3.2 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Helene Fargier , Romain Guillaume
{"title":"Decision with belief functions and generalized independence: Two impossibility theorems1","authors":"Helene Fargier ,&nbsp;Romain Guillaume","doi":"10.1016/j.ijar.2024.109283","DOIUrl":null,"url":null,"abstract":"<div><p>Dempster-Shafer theory of evidence is a framework that is expressive enough to represent both ignorance and probabilistic information. However, decision models based on belief functions proposed in the literature face limitations in a sequential context: they either abandon the principle of dynamic consistency, restrict the combination of lotteries, or relax the requirement for transitive and complete comparisons. This work formally establishes that these requirements are indeed incompatible when any form of compensation is considered. It then demonstrates that these requirements can be satisfied in non-compensatory frameworks by introducting and characterizing a dynamically consistent rule based on first-order dominance.</p></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"175 ","pages":"Article 109283"},"PeriodicalIF":3.2000,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Approximate Reasoning","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0888613X24001701","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Dempster-Shafer theory of evidence is a framework that is expressive enough to represent both ignorance and probabilistic information. However, decision models based on belief functions proposed in the literature face limitations in a sequential context: they either abandon the principle of dynamic consistency, restrict the combination of lotteries, or relax the requirement for transitive and complete comparisons. This work formally establishes that these requirements are indeed incompatible when any form of compensation is considered. It then demonstrates that these requirements can be satisfied in non-compensatory frameworks by introducting and characterizing a dynamically consistent rule based on first-order dominance.

具有信念函数和广义独立性的决策:两个不可能性定理1
Dempster-Shafer 证据理论是一个具有足够表现力的框架,既能表示无知信息,也能表示概率信息。然而,文献中提出的基于信念函数的决策模型在顺序背景下面临着局限性:它们要么放弃了动态一致性原则,要么限制了抽签的组合,要么放松了对反式和完全比较的要求。这项工作正式证明,在考虑任何形式的补偿时,这些要求确实是不相容的。然后,它通过介绍和描述基于一阶优势的动态一致规则,证明了这些要求可以在非补偿框架中得到满足。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Approximate Reasoning
International Journal of Approximate Reasoning 工程技术-计算机:人工智能
CiteScore
6.90
自引率
12.80%
发文量
170
审稿时长
67 days
期刊介绍: The International Journal of Approximate Reasoning is intended to serve as a forum for the treatment of imprecision and uncertainty in Artificial and Computational Intelligence, covering both the foundations of uncertainty theories, and the design of intelligent systems for scientific and engineering applications. It publishes high-quality research papers describing theoretical developments or innovative applications, as well as review articles on topics of general interest. Relevant topics include, but are not limited to, probabilistic reasoning and Bayesian networks, imprecise probabilities, random sets, belief functions (Dempster-Shafer theory), possibility theory, fuzzy sets, rough sets, decision theory, non-additive measures and integrals, qualitative reasoning about uncertainty, comparative probability orderings, game-theoretic probability, default reasoning, nonstandard logics, argumentation systems, inconsistency tolerant reasoning, elicitation techniques, philosophical foundations and psychological models of uncertain reasoning. Domains of application for uncertain reasoning systems include risk analysis and assessment, information retrieval and database design, information fusion, machine learning, data and web mining, computer vision, image and signal processing, intelligent data analysis, statistics, multi-agent systems, etc.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信