Strategyproof Peer Selection: Mechanisms, Analyses, and Experiments

Authors

  • Haris Aziz Data61 and University of New South Wales
  • Omer Lev University of Toronto
  • Nicholas Mattei Data61 and University of New South Wales
  • Jeffrey Rosenschein The Hebrew University of Jerusalem
  • Toby Walsh Data61 and University of New South Wales

DOI:

https://doi.org/10.1609/aaai.v30i1.10038

Keywords:

Computational Social Choice, Peer Selection, Mechanism Design

Abstract

We study an important crowdsourcing setting where agents evaluate one another and, based on these evaluations, a subset of agents are selected. This setting is ubiquitous when peer review is used for distributing awards in a team, allocating funding to scientists, and selecting publications for conferences. The fundamental challenge when applying crowdsourcing in these settings is that agents may misreport their reviews of others to increase their chances of being selected. We propose a new strategyproof (impartial) mechanism called Dollar Partition that satisfies desirable axiomatic properties. We then show, using a detailed experiment with parameter values derived from target real world domains, that our mechanism performs better on average, and in the worst case, than other strategyproof mechanisms in the literature.

Downloads

Published

2016-02-21

How to Cite

Aziz, H., Lev, O., Mattei, N., Rosenschein, J., & Walsh, T. (2016). Strategyproof Peer Selection: Mechanisms, Analyses, and Experiments. Proceedings of the AAAI Conference on Artificial Intelligence, 30(1). https://doi.org/10.1609/aaai.v30i1.10038

Issue

Section

Technical Papers: Game Theory and Economic Paradigms