Cognitive Foundations of Probability
Prediction is based on past cases. We assume that a predictor can rank eventualities according to their plausibility given any memory that consists of repetitions of past cases. In a companion paper, we show that under mild consistency requirements, these rankings can be represented by numerical functions, such that the function corresponding to each eventuality is linear in the number of case repetitions. In this paper we extend the analysis to rankings of events. Our main result is that a cancellation condition a la de Finetti implies that these functions are additive with respect ot union of disjoint sets.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||1999|
|Date of revision:|
|Contact details of provider:|| Postal: Israel TEL-AVIV UNIVERSITY, THE FOERDER INSTITUTE FOR ECONOMIC RESEARCH, RAMAT AVIV 69 978 TEL AVIV ISRAEL.|
Web page: http://econ.tau.ac.il/foerder/about
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:fth:teavfo:30-99. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.