2021
DOI: 10.1287/opre.2020.2000
|View full text |Cite
|
Sign up to set email alerts
|

Bayesian Decision Making in Groups is Hard

Abstract: Hardness of Making Rational Group Decisions

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2021
2021
2025
2025

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 23 publications
(7 citation statements)
references
References 45 publications
0
7
0
Order By: Relevance
“…Third, the refinement of the ε-greedy algorithm can be informed by studying or including other decision models, such as Bayesian SPRT, drift-diffusion, or adaptive gain models to determine stopping rules for exploration ( Tickle et al, 2021 ). Another possibility might be to use Bayesian network decision making models that incorporate agents holding private information and leveraging this for collective decisions ( Hązła et al, 2021 ).…”
Section: Discussionmentioning
confidence: 99%
“…Third, the refinement of the ε-greedy algorithm can be informed by studying or including other decision models, such as Bayesian SPRT, drift-diffusion, or adaptive gain models to determine stopping rules for exploration ( Tickle et al, 2021 ). Another possibility might be to use Bayesian network decision making models that incorporate agents holding private information and leveraging this for collective decisions ( Hązła et al, 2021 ).…”
Section: Discussionmentioning
confidence: 99%
“…In this section, we illustrate how well the proposed algorithm is able to identify the true combination matrix A ⋆ and the expected log-likelihood matrix L. We also experiment with different M in (18) to see how the convergence rate changes. Additionally, we will see how well the learned combination matrix and KL-divergences identify the influences (30).…”
Section: Computer Simulationsmentioning
confidence: 99%
“…In principle, each agent in the network could consider pursuing a fully Bayesian solution to learn and track the state of nature. However, this solution is intractable and generally NP-hard [10], [11], [18]. This is because it requires that each agent has access to the data from the entire network, in addition to their knowledge of the full graph topology.…”
Section: Introduction and Related Workmentioning
confidence: 99%
“…A particularly important focus of previous research has been on the effects of social learning when repeated over successive groups of individuals, such as child–parent learning, formal education, and other domains where knowledge is transmitted from older members of a popvvvulation to younger learners. In these multigenerational settings, knowledge can accumulate over time in a population, allowing individuals to extend their cognitive skills by learning from others (see, e.g., Almaatouq, Alsobay, Yin, & Watts, 2021; Almaatouq et al., 2020; Belikov, Rzhetsky, & Evans, 2020; Caldwell, Atkinson, & Renner, 2016; Frey & Goldstone, 2018; Galesic, Olsson, Dalege, van der Does, & Stein, 2021; Goldstone, Wisdom, Roberts, & Frey, 2013; Hazła, Jadbabaie, Mossel, & Rahimian, 2021; Kempe & Mesoudi, 2014b; Mesoudi, 2016; Mesoudi & Thornton, 2018; Miton & Charbonneau, 2018; Riedl, Kim, Gupta, Malone, & Woolley, 2021; Rzhetsky, Foster, Foster, & Evans, 2015; Salhab, Ajorlou, & Jadbabaie, 2020; Wisdom, Song, & Goldstone, 2013; Wojtowicz & DeDeo, 2020, for recent overviews and related studies). Crucially, the constraints and structure of interpersonal transmission often lead collective knowledge and learning to differ from individual outcomes (Kirby, Tamariz, Cornish, & Smith, 2015; Ravignani, Thompson, Grossi, Delgado, & Kirby, 2018; Silvey, Kirby, & Smith, 2019).…”
Section: Introductionmentioning
confidence: 99%