Collectively ranking candidates via bidding in procedurally fair ways

Theory and Decision 78 (1):23-31 (2015)
  Copy   BIBTEX

Abstract

Different evaluators typically disagree how to rank different candidates due to their idiosyncratic concerns for the various qualities of the candidates. Our ranking mechanism asks all evaluators to submit individual bids assigning a monetary amount for each possible rank order. The rules specify for all possible vectors of such individual bids the collectively binding rank order of candidates and the payments, due to the different evaluators. Three requirements uniquely determine procedurally fair ranking rules as a game form. Only when additionally assuming exogenously given true evaluations of collective rankings, which may be commonly or only privately known, and—in case of private information—beliefs concerning the evaluations by others, this game form determines proper games and allows for equilibrium analysis. After an illustration, the approach is adjusted to situations where one wants to rank only acceptable sets of candidates thus rendering the mechanism even more attractive.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2014-01-27

Downloads
24 (#639,942)

6 months
2 (#1,232,442)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references