Grading large numbers of candidates
Speaker
Estelle Varloot
Date
03/12/2024 - 12:30 - 11:15Add To Calendar
2024-12-03 11:15:00
2024-12-03 12:30:00
Grading large numbers of candidates
When considering a large set of candidates that must be graded, candidates are often assigned a subset of jury members. This is because no jury member is expected to be able to grade all candidates. In this paper, we characterize strategy-proof methods and propose a proxy-grading model that can be used to avoid bias. This process can be extended to distinguish between blank votes and abstention.
The talk is based on chapter 3 and 4 of Strategy-Proof Voting on Single-Peaked Domains - The University of Liverpool Repository
****Zoom lecture**** at https://biu-ac-il.zoom.us/j/81279119326 -- We will also convene at the economics common room to watch the broadcast together
אוניברסיטת בר-אילן - Department of Economics
Economics.Dept@mail.biu.ac.il
Asia/Jerusalem
public
Place
****Zoom lecture**** at https://biu-ac-il.zoom.us/j/81279119326 -- We will also convene at the economics common room to watch the broadcast together
Affiliation
Tel Aviv University
Abstract
When considering a large set of candidates that must be graded, candidates are often assigned a subset of jury members. This is because no jury member is expected to be able to grade all candidates. In this paper, we characterize strategy-proof methods and propose a proxy-grading model that can be used to avoid bias. This process can be extended to distinguish between blank votes and abstention.
The talk is based on chapter 3 and 4 of Strategy-Proof Voting on Single-Peaked Domains - The University of Liverpool Repository
Last Updated Date : 27/11/2024
