| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6858873 | International Journal of Approximate Reasoning | 2018 | 23 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Arthur Van Camp, Gert de Cooman, Enrique Miranda,