SearcharxivSearch

arXiv · 1904.03333

Learning in teams: peer evaluation for fair assessment of individual contributions

Abstract

The "free rider" problem has long plagued pedagogies based on collaborative learning. The most common solution to the free rider problem is peer evaluation. As well other existing methods of peer evaluation include self-evaluation --- and hence are prone to grade inflation or, as we show here, are inaccurate in that they do not fairly reward the most hard working student. Another common concern with existing methods of peer evaluation is that students often do not have the necessary skills to evaluate the work of their peers objectively. In this paper, we introduce a new mechanism for peer evaluation that does not rely on self-evaluation, and yet remains accurate, i.e., if all students are completely truthful in their evaluations, then the output of our mechanism becomes an objective truth. At the same time, our mechanism integrates the instructor's judgment with respect to the credibility of students' evaluations. For example, the instructor gives scores to students for writing credible reviews and, in turn, subsequent students' evaluations are weighted according to these instructor scores.

Explore related subjects

Keep this discovery

BibTeXRIS

Fedor Duzhin. 2019-04-06. Learning in teams: peer evaluation for fair assessment of individual contributions. https://arxiv.org/abs/1904.03333

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO