Pith. sign in

REVIEW 1 cited by

Removing Bias and Incentivizing Precision in Peer-grading

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1807.11657 v7 pith:H3WRDLAJ submitted 2018-07-31 cs.GT

classification cs.GT
keywords peqagradingpeer-gradingscoregradersmechanismperformancereliability
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We study peer-grading with competitive graders who enjoy a higher utility when their peers get lower scores. We propose a new mechanism, PEQA, that incentivizes such graders through a score-assignment rule which aggregates the final score from multiple peer-evaluations, and a grading performance score that rewards performance in the peer-grading exercise. PEQA makes grader-bias irrelevant. Additionally, under PEQA, a peer-grader's utility increases monotonically with the reliability of her grading, irrespective of her competitiveness and how her co-graders act. In a reasonably general class of score assignment rules, PEQA uniquely satisfies this utility- reliability monotonicity. When grading is costly and costs are private information, a modified version of PEQA implements the socially optimal effort choices in an equilibrium of the peer-evaluation game. Data from our classroom experiments confirm our theoretical assumptions and show that PEQA outperforms the popular median mechanism.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks

    cs.LG 2024-11 conditional novelty 6.0 of 10

    Reranking symmetric-task inputs so that query-relevant elements occupy high-exposure positions can substantially reduce LLM errors on aggregate queries.

Pith tools