Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE (www.oxfordhandbooks.com). © Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a title in Oxford Handbooks Online for personal use (for details see Privacy Policy and Legal Notice).

date: 20 September 2019

Abstract and Keywords

This chapter reviews work on group decision making and problem solving. Included are topics both within and outside traditional boundaries of social psychology, such as collective induction, swarm intelligence models, jury decision making, information sharing, collaborative memory, gossip, brainstorming, and team mental models. The literature is discussed in terms of the collective information search and distribution model, which highlights group members' motivational and cognitive processes as well as the demonstrability of the group task. The 2 ´ 2 model distinguishes (1) motives that members hold for themselves from those they hold for the group as a whole and (2) motives related to acquiring knowledge from those related to facilitating intragroup and intergroup relations. The model assumes that each general class of motives has various subtypes and that group members can have multiple motives at one time. In addition to providing a useful framework for organizing the literature, the model suggests ideas for further investigation.

Keywords: group cognition, group decision making, group problem solving, jury decision making, collective induction, collaborative memory, gossip, team mental models

Access to the complete content on Oxford Handbooks Online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can''t find the answer there, please contact us.