The Conjunction Fallacy: Explanations of the Linda Problem by the Theory of Hints
Empirical research has shown that in some situations subjects tend to assign a probability to a conjunction of two events that is larger than the probability they assign to each of these two events. This empirical phenomenon is traditionally called the conjunction fallacy. One of the best known experiment used to demonstrate the conjunction fallacy is the Linda problem introduced by Tversky and Kahneman in 1982. They explain the “fallacious behavior” by their so-called judgemental heuristics. These heuristics have been heavily criticized by Gigerenzer (1996) as being far “too vague to count as explanations”. In this paper, it is shown that the “fallacious behavior” in the Linda problem can be explained by the so-called Theory of Hints developed by Kohlas and Monney in 1995.
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:||Apr 2002|
|Date of revision:|
|Publication status:||Published in International Journal of Intelligent Systems, 2003, vol. 18, no. 1, pp. 75-91.|
|Contact details of provider:|| Postal: Bd de Pérolles 90, CH-1700 Fribourg|
Phone: +41 26 300 8200
Fax: +41 26 300 9725
Web page: http://www.unifr.ch/ses/
More information through EDIRC
|Order Information:|| Email: |
When requesting a correction, please mention this item's handle: RePEc:fri:fribow:347. 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: (Ivo raemy)
If references are entirely missing, you can add them using this form.