When less is more in the recognition heuristic
The ``less is more effect'' (LIME) occurs when a recognition-dependent agent has a greater probability of choosing the better item than a more knowledgeable agent who recognizes more items. Goldstein and Gigerenzer (2002) define alpha as the probability that a correct choice is made on the basis of recognition alone and beta the probability that a correct choice is made when both items are recognized (via additional cues). They claim that the LIME occurs only when alpha > beta (and assuming alpha > 1/2). However, their argument also assumes that alpha and beta remain constant as the number of recognized items, n, varies. In fact, it can be shown that neither of these parameters generally remains constant as n varies, and neither of them are simple functions of n. Therefore, a new theoretical basis for the LIME is needed. This paper provides mathematical results for understanding when the LIME can occur and elucidates implications of these results. The major findings presented here are as follows: * Demonstrations that the LIME can occur when alpha leq beta and fail to occur when alpha > beta, and derivation of the conditions for these co-occurrences; * A new characterization of the conditions under which the LIME occurs; * Generalizations of this characterization to handle imperfect recognition; and * Characterization of when the LIME occurs as more items become recognized. The primary implication of these results is that the advantage of the recognition cue depends not only on cue validities, but also on the order in which items are learned. This realization, in turn, suggests that research in this area should incorporate a more dynamic focus on learning and memory processes, and the effects of reputational information.
Volume (Year): 5 (2010)
Issue (Month): 4 (July)
|Contact details of provider:|| |
When requesting a correction, please mention this item's handle: RePEc:jdm:journl:v:5:y:2010:i:4:p:230-243. 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: (Jonathan Baron)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.