Dealing with Expert Bias in Collective Decision-Making
Not on the map. Why?
Abstract (arXiv)
Quite some real-world problems can be formulated as decision-making problems wherein one must repeatedly make an appropriate choice from a set of alternatives. Multiple expert judgements, whether human or artificial, can help in taking correct decisions, especially when exploration of alternative solutions is costly. As expert opinions might deviate, the problem of finding the right alternative can be approached as a collective decision making problem (CDM) via aggregation of independent judgements. Current state-of-the-art approaches focus on efficiently finding the optimal expert, and thus perform poorly if all experts are not qualified or if they are overly biased, thereby potentially derailing the decision-making process. In this paper, we propose a new algorithmic approach based on contextual multi-armed bandit problems (CMAB) to identify and counteract such biased expertise. We explore homogeneous, heterogeneous and polarised expert groups and show that this approach is able to effectively exploit the collective expertise, outperforming state-of-the-art methods, especially when the quality of the provided expertise degrades. Our novel CMAB-inspired approach achieves a higher final performance and does so while converging more rapidly than previous adaptive algorithms.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 15 of its 69 references that are in the map. First posted on arXiv 25 Jun 2021.
Builds on
15 of 69 references.
References · 15
- 2017A Tutorial on Thompson Samplingcited by 420
- 2018Confounding variables can degrade generalization performance of radiological deep learning modelscited by 374
- 2014Taming the Monster: A Fast and Simple Algorithm for Contextual Banditscited by 200
- 2020Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oraclescited by 195
- 2013Finite-Time Analysis of Kernelised Contextual Banditscited by 177
- 2015Explore no more: Improved high-probability regret bounds for non-stochastic banditscited by 120
- 2020Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits under Realizabilitycited by 114
- 2018Practical Contextual Bandits with Regression Oraclescited by 92
- 2019A Survey on Practical Applications of Multi-Armed and Contextual Banditscited by 44
- 2017Misspecified Linear Banditscited by 41
- 2015A Survey on Contextual Multi-armed Banditscited by 34
- 2013Multi-Armed Bandits for Intelligent Tutoring Systemscited by 21
3 more
- 2021Adapting to Misspecification in Contextual Bandits with Offline Regression Oraclescited by 21
- 2015Online Gradient Boostingcited by 15
- 2021Boosting for Online Convex Optimizationcited by 11
Built on by
Citing papers per year: 2023: 2; 2024: 1; 2025: 1.
4 papers.
- 2023ACROCPoLis: A Descriptive Framework for Making Sense of Fairnesscited by 8
- 2023Expertise Trees Resolve Knowledge Limitations in Collective Decision-Makingcited by 3
- 2024Mitigating Biases in Collective Decision-Making: Enhancing Performance in the Face of Fake Newscited by 2
- 2025Optimizing Resources for On-the-Fly Label Estimation with Multiple Unknown Medical Expertscited by 0
- 2025Optimizing Resources for On-the-Fly Label Estimation with Multiple Unknown Medical Experts4 Oct 2025
- 2024Mitigating Biases in Collective Decision-Making: Enhancing Performance in the Face of Fake News11 Mar 2024
- 2023Expertise Trees Resolve Knowledge Limitations in Collective Decision-Making2 May 2023
- 2023ACROCPoLis: A Descriptive Framework for Making Sense of Fairness19 Apr 2023