Advanced search

Finitary characterizations of sets of lower previsions

Author
Organization
Abstract
The criteria that characterize many interesting classes of lower previsions, such as coherent or k-monotone lower probabilities, can in finite spaces often be seen as a set of linear constraints on the set of lower previsions in the class, which therefore is a convex polyhedron. It can be equivalently characterized by its set of vertices. For all interesting classes that I studied, the set of vertices or necessary and sufficient constraints is finite. In the presentation I aim to make these representations a bit more concrete to people, so that their possible uses – both in applications and theory – can be discussed in a tangible way.

Citation

Please use this url to cite or link to this publication:

Chicago
Quaeghebeur, Erik. 2011. “Finitary Characterizations of Sets of Lower Previsions.” In Geometry of Imprecise Probability and Related Statistical Methods, Workshop Abstracts.
APA
Quaeghebeur, E. (2011). Finitary characterizations of sets of lower previsions. Geometry of Imprecise Probability and related Statistical Methods, Workshop abstracts. Presented at the 2011 Workshop on Geometry of Imprecise Probability and related Statistical Methods (GEOMIP-11).
Vancouver
1.
Quaeghebeur E. Finitary characterizations of sets of lower previsions. Geometry of Imprecise Probability and related Statistical Methods, Workshop abstracts. 2011.
MLA
Quaeghebeur, Erik. “Finitary Characterizations of Sets of Lower Previsions.” Geometry of Imprecise Probability and Related Statistical Methods, Workshop Abstracts. 2011. Print.
@inproceedings{1974606,
  abstract     = {The criteria that characterize many interesting classes of lower previsions, such as coherent or k-monotone lower probabilities, can in finite spaces often be seen as a set of linear constraints on the set of lower previsions in the class, which therefore is a convex polyhedron. It can be equivalently characterized by its set of vertices. For all interesting classes that I studied, the set of vertices or necessary and sufficient constraints is finite. In the presentation I aim to make these representations a bit more concrete to people, so that their possible uses -- both in applications and theory -- can be discussed in a tangible way.},
  author       = {Quaeghebeur, Erik},
  booktitle    = {Geometry of Imprecise Probability and related Statistical Methods, Workshop abstracts},
  language     = {eng},
  location     = {Durham, UK},
  title        = {Finitary characterizations of sets of lower previsions},
  year         = {2011},
}