Metraipolis › archive › dc_7a5248e751b2
Dynamical networks of influence in small group discussions — Europe PMC PMID:29338013
- Source
- Europe PMC (en)
- Original
- https://europepmc.org/article/MED/29338013
- DOI
- 10.1371/journal.pone.0190541
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T00:39:01.544Z
- SHA-256 of the archived text
5b9bd716662075786975c1bfaf59c12d23dae65bae551530528194cb43e0d7d9- Stable URL of this page
https://metraipolis.com/documento/dc_7a5248e751b2
How to cite
Dynamical networks of influence in small group discussions — Europe PMC PMID:29338013 — Europe PMC (en), https://europepmc.org/article/MED/29338013 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7a5248e751b2 (Metraipolis archive dc_7a5248e751b2, sha256 5b9bd716662075786975c1bfaf59c12d23dae65bae551530528194cb43e0d7d9)
BibTeX
@misc{dc7a5248e751b2,
title = {Dynamical networks of influence in small group discussions — Europe PMC PMID:29338013},
howpublished = {Europe PMC (en)},
url = {https://europepmc.org/article/MED/29338013},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7a5248e751b2; sha256 5b9bd716662075786975c1bfaf59c12d23dae65bae551530528194cb43e0d7d9},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: Europe PMC (en), https://europepmc.org/article/MED/29338013. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In many domains of life, business and management, numerous problems are addressed by small groups of individuals engaged in face-to-face discussions. While research in social psychology has a long history of studying the determinants of small group performances, the internal dynamics that govern a group discussion are not yet well understood. Here, we rely on computational methods based on network analyses and opinion dynamics to describe how individuals influence each other during a group discussion. We consider the situation in which a small group of three individuals engages in a discussion to solve an estimation task. We propose a model describing how group members gradually influence each other and revise their judgments over the course of the discussion. The main component of the model is an influence network-a weighted, directed graph that determines the extent to which individuals influence each other during the discussion. In simulations, we first study the optimal structure of the influence network that yields the best group performances. Then, we implement a social learning process by which individuals adapt to the past performance of their peers, thereby affecting the structure of the influence network in the long run. We explore the mechanisms underlying the emergence of efficient or maladaptive networks and show that the influence network can converge towards the optimal one, but only when individuals exhibit a social discounting bias by downgrading the relative performances of their peers. Finally, we find a late-speaker effect, whereby individuals who speak later in the discussion are perceived more positively in the long run and are thus more influential. The numerous predictions of the model can serve as a basis for future experiments, and this work opens research on small group discussion to computational social sciences. Tema degli esploratori: governance digitale e beni comuni (ricerca Europe PMC «collective intelligence», solo open access). Pubblicazione: PloS one, 2018 (prima pubblicazione 2018-01-16). Identificativi: PMID 29338013 · PMCID PMC5770023 · DOI 10.1371/journal.pone.0190541. Descrittori MeSH principali: Group Processes. Pagina: https://europepmc.org/article/MED/29338013 — https://doi.org/10.1371/journal.pone.0190541. Autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza dell'articolo dichiarata da Europe PMC: CC0 (la versione è indicata dall'editore sulla pagina). Abstract riportato senza modifiche al contenuto, con attribuzione; deposito marcato CC0. Letto il 2026-10-08T00:14:58.346Z tramite l'API REST ufficiale di Europe PMC (EMBL-EBI), nel rispetto del robots.txt e del crawl-delay.