Preventing Arbitrage from Collusion When Eliciting Probabilities
Rupert Freeman, David M. Pennock, Dominik Peters, Bo Waggoner
Abstract
We consider the design of mechanisms to elicit probabilistic forecasts when agents are strategic and may collude with one another. Chun and Shachter [2011] have shown that when agents may form coalitions, many known mechanisms for elicitation permit arbitrage, allowing the coalition members to guarantee themselves higher payments by misreporting their beliefs. We consider two approaches to protect against colluding agents. First, we present a novel strictly proper mechanism that does not admit arbitrage provided that the reports of the agents are bounded away from 0 and 1, a common assumption in many settings. Second, we discover weakly proper mechanisms that are fully arbitrage free for general beliefs. We show that a subclass of these mechanisms satisfies an appealing and natural intermediate guarantee, in between weak and strict, that preserves many of the advantages of strictly proper mechanisms.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers1
Ask how each one uses itRelated papers
- Information Elicitation from Rowdy CrowdsGrant Schoenebeck, Fang-Yi Yu, Yichi ZhangWWW 2021 · 18 citations
- Stochastically Dominant Peer PredictionYichi Zhang, Shengwei Xu, Grant Schoenebeck, David M. PennockNeurIPS 2025 · 2 citations
- Mechanism Design for Collaborative Normal Mean EstimationYiding Chen, Jerry Zhu, Kirthevasan KandasamyNeurIPS 2023 · 15 citations
- Peer Prediction for Learning AgentsShi Feng, Fang-Yi Yu, Yiling ChenNeurIPS 2022 · 9 citations
- Wisdom of the Crowd Voting: Truthful Aggregation of Voter Information and PreferencesGrant Schoenebeck, Biaoshuai TaoNeurIPS 2021 · 22 citations
