A complete characterization of normal cones and extreme points for $p$-boxes
Damjan \v{S}kulj

TL;DR
This paper provides a comprehensive mathematical characterization of the structure of $p$-boxes, including normal cones and extreme points, which are crucial for understanding bounds on expectations in imprecise probability models.
Contribution
It offers a complete characterization of normal cones and extreme points for $p$-boxes on finite domains, linking geometric structures to probabilistic bounds.
Findings
Characterization of all normal cones for $p$-boxes.
Relation between normal cones and extreme points.
Identification of adjacency structure among normal cones.
Abstract
Probability boxes, also known as -boxes, correspond to sets of probability distributions bounded by a pair of distribution functions. They fall into the class of models known as imprecise probabilities. One of the central questions related to imprecise probabilities are the intervals of values corresponding to expectations of random variables, and especially the interval bounds. In general, those are attained in extremal points of credal sets, which denote convex sets of compatible probabilistic models. The aim of this paper is a characterization and identification of extreme points corresponding to -boxes on finite domains. To accomplish this, we utilize the concept of normal cones. In the settings of imprecise probabilities, those correspond to sets of random variables whose extremal expectations are attained in a common extreme point. Our main results include a characterization…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMulti-Criteria Decision Making · Rough Sets and Fuzzy Logic · Bayesian Modeling and Causal Inference
