.png){kind=icon}
返回
Lexicographic choice functions
.png){kind=icon}
OA
AI
DOI：10.1016/j.ijar.2017.10.011.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We investigate a generalisation of the coherent choice functions considered by Seidenfeld et al. [35], by sticking to the convexity axiom but imposing no Archimedeanity condition. We define our choice functions on vector spaces of options, which allows us to incorporate as special cases both Seidenfeld et al.'s [35] choice functions on horse lotteries and also pairwise choice-which is equivalent to sets of desirable gambles [29]-, and to investigate their connections. We show that choice functions based on sets of desirable options (gambles) satisfy Seidenfeld's convexity axiom only for very particular types of sets of desirable options, which are exactly those that are representable by lexicographic probability systems that have no non-trivial Savage-null events. We call them lexicographic choice functions. Finally, we prove that these choice functions can be used to determine the most conservative convex choice function associated with a given binary relation. (C) 2017 Elsevier Inc. All rights reserved.
Keyword:
Choice functions
Coherence
Lexicographic probabilities
Horse lotteries
Maximality
Sets of desirable gambles
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
3.0K
被引数:
5.1K
机构
引用论文
.png){kind=icon}
Spray and Combustion Characteristics of HCCI Engine Using DME/Diesel Blended Fuel by Port-Injection
PREAI
分享收藏
查看更多内容