Economics at your fingertips  

Partial probabilistic information

Alain Chateauneuf () and Caroline Ventura

Journal of Mathematical Economics, 2011, vol. 47, issue 1, 22-28

Abstract: Abstract Suppose a decision maker (DM) has partial information about certain events of a [sigma]-algebra belonging to a set and assesses their likelihood through a capacity v. When is this information probabilistic, i.e. compatible with a probability? We consider three notions of compatibility with a probability in increasing degree of preciseness. The weakest requires the existence of a probability P on such that P(E)>=v(E) for all , we then say that v is a probability lower bound. A stronger one is to ask that v be a lower probability, that is the infimum of a family of probabilities on . The strongest notion of compatibility is for v to be an extendable probability, i.e. there exists a probability P on which coincides with v on . We give necessary and sufficient conditions on v in each case and, when is finite, we provide effective algorithms that check them in a finite number of steps.

Keywords: Partial; probabilistic; information; Exact; capacity; Core; Extensions; of; set; functions (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed

Downloads: (external link)
Full text for ScienceDirect subscribers only

Related works:
Working Paper: Partial probabilistic information (2011)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link:

Access Statistics for this article

Journal of Mathematical Economics is currently edited by Atsushi (A.) Kajii

More articles in Journal of Mathematical Economics from Elsevier
Bibliographic data for series maintained by Dana Niculescu ().

Page updated 2020-01-11
Handle: RePEc:eee:mateco:v:47:y:2011:i:1:p:22-28