Research map / Bandits and online learning / Multi-armed bandits
Partial Truthfulness in Minimal Peer Prediction Mechanisms With Limited Knowledge
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use UCB1 to adaptively select the PTS representative distribution based on report disagreement | AdaPTS · Limited-knowledge single-task peer prediction | expected number of non-truthful reports: O(\log n) | Helped |
| Use a minimal mechanism with limited knowledge rather than assuming a universally truthful payment function | Minimal peer prediction mechanisms · Limited-knowledge single-task peer prediction | dishonesty limit: \Theta(\log n) | Mixed |
| Use AdaPTS to elicit reports while tolerating a logarithmic number of dishonest reports | AdaPTS · Limited-knowledge single-task peer prediction | expected difference between report and signal histograms: \frac{O(\log n)}{n} | Helped |
Closest papers by meaning
- Stochastically Dominant Peer Prediction (NeurIPS 2025 · similarity 0.90)
- Carrot and Stick: Eliciting Comparison Data and Beyond (NeurIPS 2024 · similarity 0.90)
- Incentivizing Truthful Language Models via Peer Elicitation Games (NeurIPS 2025 · similarity 0.87)
- Plant-and-Steal: Truthful Fair Allocations via Predictions (NeurIPS 2024 · similarity 0.86)
- A Cramér–von Mises Approach to Incentivizing Truthful Data Sharing (NeurIPS 2025 · similarity 0.86)
- Peer Neighborhood Mechanisms: A Framework for Mechanism Generalization (AAAI 2024 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.