Characterizing the Set of Coherent Lower Previsions with a Finite Number of Constraints or Vertices
Lists
Only you see this
Abstract
The standard coherence criterion for lower previsions is expressed using an infinite number of linear constraints. For lower previsions that are essentially defined on some finite set of gambles on a finite possibility space, we present a reformulation of this criterion that only uses a finite number of constraints. Any such lower prevision is coherent if it lies within the convex polytope defined by these constraints. The vertices of this polytope are the extreme coherent lower previsions for the given set of gambles. Our reformulation makes it possible to compute them. We show how this is done and illustrate the procedure and its results.
BibTeX
@misc{quaeghebeur2010characterizing,
author = {Erik Quaeghebeur},
title = {{Characterizing the Set of Coherent Lower Previsions with a Finite Number of Constraints or Vertices}},
year = {2010},
eprint = {1203.3509},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/1203.3509},
}| Learning from samples using coherent lower previsions | Ghent · 2009 |
| A Logic for Reasoning about Upper Probabilities | JAIR · 2002 |
| Exchangeable lower previsions | arXiv · 2008 |
| Introduction to the Theory of Imprecise Probability | Springerbriefs · 2021 |
| Information Algebras of Coherent Sets of Gambles in General Possibility Spaces | Isipta · 2021 |
| Information algebras in the theory of imprecise probabilities | arXiv · 2021 |