Can simple group heuristics detect hidden profiles in randomly generated environments

Details

Serval ID
serval:BIB_0B95F88B6B28
Type
Article: article from journal or magazin.
Collection
Publications
Institution
Title
Can simple group heuristics detect hidden profiles in randomly generated environments
Journal
Swiss Journal of Psychology
Author(s)
Reimer T., Hoffrage U.
ISSN
1421-0185
Publication state
Published
Issued date
2005
Peer-reviewed
Oui
Volume
64
Number
1
Pages
21-37
Language
english
Abstract
Research on the hidden-profile effect (Stasser, 1992) has revealed that groups often fail to detect the choice alternative with the highest sum score if the individual group members' information points to another alternative. We conducted a simulation study in which we randomly generated distributions of information such that they did or did not contain a hidden profile. The simulated groups solved the tasks by applying a unit weight linear model or a fast and frugal heuristic (Minimalist or Take The Best). Overall, a communication-based lexicographic heuristic performed best across the different environments. This fast and frugal heuristic makes cue-wise comparisons of alternatives while pooling information during group discussion. Moreover, results show that performance depends on whether group members share and exchange information on valid or on invalid cues. Directions for future research are discussed.
Keywords
Group decision making, Hidden-profile effect, Shared information, Decision strategies, Unit weight linear model, Lexicographic heuristic
Web of science
Create date
24/02/2009 14:34
Last modification date
20/08/2019 12:33
Usage data