Group Fairness in Peer Review

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Aziz, Haris, Micha, Evi, Shah, Nisarg
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866913531977269248
author Aziz, Haris
Micha, Evi
Shah, Nisarg
author_facet Aziz, Haris
Micha, Evi
Shah, Nisarg
contents Large conferences such as NeurIPS and AAAI serve as crossroads of various AI fields, since they attract submissions from a vast number of communities. However, in some cases, this has resulted in a poor reviewing experience for some communities, whose submissions get assigned to less qualified reviewers outside of their communities. An often-advocated solution is to break up any such large conference into smaller conferences, but this can lead to isolation of communities and harm interdisciplinary research. We tackle this challenge by introducing a notion of group fairness, called the core, which requires that every possible community (subset of researchers) to be treated in a way that prevents them from unilaterally benefiting by withdrawing from a large conference. We study a simple peer review model, prove that it always admits a reviewing assignment in the core, and design an efficient algorithm to find one such assignment. We use real data from CVPR and ICLR conferences to compare our algorithm to existing reviewing assignment algorithms on a number of metrics.
format Preprint
id arxiv_https___arxiv_org_abs_2410_03474
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Group Fairness in Peer Review
Aziz, Haris
Micha, Evi
Shah, Nisarg
Computer Science and Game Theory
Artificial Intelligence
Social and Information Networks
Physics and Society
Large conferences such as NeurIPS and AAAI serve as crossroads of various AI fields, since they attract submissions from a vast number of communities. However, in some cases, this has resulted in a poor reviewing experience for some communities, whose submissions get assigned to less qualified reviewers outside of their communities. An often-advocated solution is to break up any such large conference into smaller conferences, but this can lead to isolation of communities and harm interdisciplinary research. We tackle this challenge by introducing a notion of group fairness, called the core, which requires that every possible community (subset of researchers) to be treated in a way that prevents them from unilaterally benefiting by withdrawing from a large conference. We study a simple peer review model, prove that it always admits a reviewing assignment in the core, and design an efficient algorithm to find one such assignment. We use real data from CVPR and ICLR conferences to compare our algorithm to existing reviewing assignment algorithms on a number of metrics.
title Group Fairness in Peer Review
topic Computer Science and Game Theory
Artificial Intelligence
Social and Information Networks
Physics and Society
url https://arxiv.org/abs/2410.03474