Elicitation for Aggregation
Rafael M. Frongillo, Yiling Chen, Ian A. Kash

TL;DR
This paper explores how to effectively elicit and combine probabilistic predictions from multiple Bayesian agents by capturing their confidence levels, enabling accurate aggregation with minimal sample access.
Contribution
It introduces a method to elicit confidence via hyperparameters from conjugate priors, facilitating optimal aggregation of agents' predictions with limited samples.
Findings
One sample suffices for aggregation if each posterior is uniquely identified by the hyperparameter.
The uniqueness of the hyperparameter enables successful aggregation using proper scoring rules.
A novel mechanism is proposed for cases where the hyperparameter uniqueness does not hold, with two samples.
Abstract
We study the problem of eliciting and aggregating probabilistic information from multiple agents. In order to successfully aggregate the predictions of agents, the principal needs to elicit some notion of confidence from agents, capturing how much experience or knowledge led to their predictions. To formalize this, we consider a principal who wishes to elicit predictions about a random variable from a group of Bayesian agents, each of whom have privately observed some independent samples of the random variable, and hopes to aggregate the predictions as if she had directly observed the samples of all agents. Leveraging techniques from Bayesian statistics, we represent confidence as the number of samples an agent has observed, which is quantified by a hyperparameter from a conjugate family of prior distributions. This then allows us to show that if the principal has access to a few…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
