paper-with-me

홈 › Papers

The Square Root Agreement Rule for Incentivizing Truthful Feedback on Online Platforms

2015-07-25 · Vijay Kamble, Nihar Shah, David Marn, Abhay Parekh, Kannan Ramachandran

A major challenge in obtaining evaluations of products or services on e-commerce platforms is eliciting informative responses in the absence of verifiability. This paper proposes the Square Root Agreement Rule (SRA): a simple reward mechanism that incentivizes truthful responses to objective evaluations on such platforms. In this mechanism, an agent gets a reward for an evaluation only if her answer matches that of her peer, where this reward is inversely proportional to a popularity index of the answer. This index is defined to be the square root of the empirical frequency at which any two agents performing the same evaluation agree on the particular answer across evaluations of similar entities operating on the platform. Rarely agreed-upon answers thus earn a higher reward than answers for which agreements are relatively more common. We show that in the many tasks regime, the truthful equilibrium under SRA is strictly payoff-dominant across large classes of natural equilibria that could arise in these settings, thus increasing the likelihood of its adoption. While there exist other mechanisms achieving such guarantees, they either impose additional assumptions on the response distribution that are not generally satisfied for objective evaluations or they incentivize truthful behavior only if each agent performs a prohibitively large number of evaluations and commits to using the same strategy for each evaluation. SRA is the first known incentive mechanism satisfying such guarantees without imposing any such requirements. Moreover, our empirical findings demonstrate the robustness of the incentive properties of SRA in the presence of mild subjectivity or observational biases in the responses. These properties make SRA uniquely attractive for administering reward-based incentive schemes (e.g., rebates, discounts, reputation scores, etc.) on online platforms.

📄 PDF Abstract BibTeX arXiv:1507.07045

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Stochastically Dominant Peer Prediction

2025-06-02 · Yichi Zhang, Shengwei Xu, David Pennock, Grant Schoenebeck

Eliciting reliable human feedback is essential for many machine learning tasks, such as learning from noisy labels and aligning AI systems with human preferences. Peer prediction mechanisms incentivize truthful reporting…

FairnessPredictionSensitivity

Knowledge-Free Correlated Agreement for Incentivizing Federated Learning

2026-05-06 · Leon Witt, Togrul Abbasli, Kentaroh Toyoda, Wojciech Samek 외 arxiv

We introduce Knowledge-Free Correlated Agreement (KFCA) to reward client contributions in federated learning (FL) without relying on ground truth, a public test set, or distribution knowledge. Under categorical reports a…

Federated Learning

Learning to Incentivize: Eliciting Effort via Output Agreement

2016-04-17 · Yang Liu, Yi-Ling Chen

In crowdsourcing when there is a lack of verification for contributed answers, output agreement mechanisms are often used to incentivize participants to provide truthful answers when the correct answer is hold by the maj…

Incentive-Aligned Multi-Source LLM Summaries

2025-09-29 · Yanchen Jiang, Zhe Feng, Aranyak Mehta arxiv

Large language models (LLMs) are increasingly used in modern search and answer systems to synthesize multiple, sometimes conflicting, texts into a single response, yet current pipelines offer weak incentives for sources …

Text Summarization

Consensus and Disagreement: Information Aggregation under (not so) Naive Learning

2023-11-14 · Abhijit Banerjee, Olivier Compte

We explore a model of non-Bayesian information aggregation in networks. Agents non-cooperatively choose among Friedkin-Johnsen type aggregation rules to maximize payoffs. The DeGroot rule is chosen in equilibrium if and …