Lexicographic choice functions without archimedeanicityReportar como inadecuado

Lexicographic choice functions without archimedeanicity - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

(2017)SOFT METHODS FOR DATA SCIENCE .In Advances in Intelligent Systems and Computing456.p.479-486 Mark abstract We investigate the connection between choice functions and lexicographic probabilities, by means of the convexity axiom considered by Seidenfeld, Schervisch and Kadane (2010) but without imposing any Archimedean condition. We show that lexicographic probabilities are related to a particular type of sets of desirable gambles, and investigate the properties of the coherent choice function this induces via maximality. Finally, we show that the convexity axiom is necessary but not sufficient for a coherent choice function to be the infimum of a class of lexicographic ones.

Please use this url to cite or link to this publication: http://hdl.handle.net/1854/LU-8079477

Autor: Arthur Van Camp , Enrique Miranda and Gert De Cooman

Fuente: https://biblio.ugent.be/publication/8079477


Documentos relacionados