Peer assessments, in which people review the works of peers and have their own works reviewed by peers, are useful for assessing homework, reviewing academic papers and so on. In conventional peer assessment systems, works are usually allocated to people before the assessment begins; therefore, if people drop out (abandoning reviews) during an assessment period, an imbalance occurs between the number of works a person reviews and that of peers who have reviewed the work. When the total imbalance increases, some people who diligently complete reviews may suffer from a lack of reviews and be discouraged to participate in future peer assessments. Therefore, in this study, we adopt a new adaptive allocation approach in which people are allocated review works only when requested and propose an algorithm for allocating works to people, which reduces the total imbalance. To show the effectiveness of the proposed algorithm, we provide an upper bound of the total imbalance that the proposed algorithm yields. In addition, we experimentally compare the proposed adaptive allocation to existing nonadaptive allocation methods.
CITATION STYLE
Ohashi, H., Asano, Y., Shimizu, T., & Yoshikawa, M. (2019). Give and Take: Adaptive Balanced Allocation for Peer Assessments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11653 LNCS, pp. 456–468). Springer Verlag. https://doi.org/10.1007/978-3-030-26176-4_38
Mendeley helps you to discover research relevant for your work.