Abstract
The effective use of group problem solving in the search for solutions over ambiguous problem spaces remains a challenge. Through a controlled two-stage experimental design we explore the impact of group structure, problem complexity, and search strategies on problem solving performance. We find support for prior theoretical predictions regarding the impact of problem complexity on the performance among different group structures. Our results also confirm that under certain problem complexity conditions collaborative groups may search more effectively. Through a granular examination, we demonstrate that the number of solutions generated during a search might be an imperfect proxy for performance: it is neither the only predictor of performance (solution space coverage and the distance of search increments matter), nor does it necessarily have a positive impact. Finally, the effects of diverse past solution attempts during search may shape collaborative search effectiveness in non-uniform ways.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
