pith. sign in

arxiv: 1309.1228 · v1 · pith:PP5KFKO3new · submitted 2013-09-05 · 💻 cs.AI

Weighted regret-based likelihood: a new approach to describing uncertainty

classification 💻 cs.AI
keywords probabilityuncertaintyweighteddefinedlikelihoodeventmeasuresnotion
0
0 comments X
read the original abstract

Recently, Halpern and Leung suggested representing uncertainty by a weighted set of probability measures, and suggested a way of making decisions based on this representation of uncertainty: maximizing weighted regret. Their paper does not answer an apparently simpler question: what it means, according to this representation of uncertainty, for an event E to be more likely than an event E'. In this paper, a notion of comparative likelihood when uncertainty is represented by a weighted set of probability measures is defined. It generalizes the ordering defined by probability (and by lower probability) in a natural way; a generalization of upper probability can also be defined. A complete axiomatic characterization of this notion of regret-based likelihood is given.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.