Characterizing the set of coherent lower previsions with a finite number of constraints or vertices

Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence, UAI 2010

Volumn , Issue , 2010, Pages 466-473

  Quaeghebeur, Erik ^a,b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b GHENT UNIVERSITY   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COHERENCE CRITERION; COHERENT LOWER PREVISIONS; CONVEX POLYTOPES; FINITE NUMBER; FINITE SET; INFINITE NUMBERS; LINEAR CONSTRAINTS; LOWER PREVISION;

ARTIFICIAL INTELLIGENCE;

EID: 80052927966     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Alexandrov V., Kopteva N. & Kutateladze S.S. (2005). Blaschke addition and convex polyhedra. 26, 8-30. URL: http://arxiv.org/abs/math.MG/ 0502345
2. Avis D. (2000). lrs: A revised implementation of the reverse search vertex enumeration algorithm. Polytopes - combinatorics and computation. Vol. 29. DMV Seminar. Birkhauser-Verlag, 177-198. URL: http://cgm.cs.mcgill.ca/~avis/ C/lrs.html. The floatingpoint versions gave erroneous results-due to round-off errors?
3. Brüning M. & Dennenberg D. (2008). The extreme points of the set of belief measures. International Journal of Approximate Reasoning 48.3, 670-675. DOI: 10.1016/j.ijar.2006.11.003
4. Cozman F.G., de Campos C.P., Ide J.S. & Ferreira da Rocha J.C. (2004). Propositional and relational Bayesian networks associated with imprecise and qualitative probabilistic assessments. UAI 2004, 104-111
5. De Cooman G. & Zaffalon M. (2003). Updating with incomplete observations. UAI 2003, 142-150
6. De Cooman G., Hermans F. & Quaeghebeur E. (2008). Sensitivity analysis for finite Markov chains in discrete time. UAI 2008, 129-136
7. de Finetti B. (1974-1975). Theory of probability. Wiley
8. Fukuda K. & Prodon A. (1996). Double description method revisited. Combinatorics and Computer Science. Vol. 1120. LNCS. Springer-Verlag, 91-111. DOI: 10.1007/3-540-61576-8-77.URL: http://www.ifor.math.ethz.ch/~fukuda/cdd- home/ (Pubitemid 126117805)
9. Grünbaum B. (1967). Convex Polytopes. Interscience Publishers
10. Grünwald P.D. & Halpern J.Y. (2008). A game-theoretic analysis of updating sets of probabilities. UAI 2008, 240-247
11. Implementation. Details of the implementation of the finitary coherence criterion are embedded as the file 'UAI-ELPrev-implementation. pdf' in the PDF file of this paper
12. Output. A compilation of coherence constraints, vertices and adjacencies for different sets of gambles are embedded as the archive 'constraints-results. zip' in the PDF file of this paper
13. Proofs. Proofs for the technical results in this paper are embedded as the file 'UAI-ELPrev-proofs.pdf' in the PDF file of this paper
14. Quaeghebeur E. (2009). Learning from samples using coherent lower previsions. PhD thesis. Ghent University. URL: http://hdl.handle.net/1854/LU- 495650
15. Quaeghebeur E. & De Cooman G. (2008). Extreme lower probabilities. Fuzzy Sets and Systems 159.16, 2163-2175. DOI: 10. 1016/j.fss.2007.11.020. URL: http://hdl.handle.net/1854/11713. Quaeghebeur (2009, Ch. 2) gives a more extensive discussion
16. Walley P., Pelessoni R. & Vicig P. (2004). Direct algorithms for checking consistency and making inferences from conditional probability assessments. Journal of Statistical Planning and Inference 126.1, 119-151. DOI: 10.1016/j.jspi.2003.09.005 (Pubitemid 39167903)
17. Walley P. (1991). Statistical reasoning with imprecise probabilities. Chapman and Hall. This first big, greatly augmented synthesis of the topic contains a wealth of references to earlier literature
18. Ziegler G.M. (1995). Lectures on polytopes. Springer