Collectively Ranking Candidates - An Axiomatic Approach -
Abstract
Different evaluators typically disagree how to rank different candidates since they care more or less for the various qualities of the candidates. It is assumed that all evaluators submit vector bids assigning a monetary bid for each possible rank order. The rules must specify for all possible vectors of such vector bids the collectively binding rank order of candidates and the "payments" for this bid vector and its implied rank order. Three axioms uniquely define the "procedurally fair" ranking rules. We finally discuss how our approach can be adjusted to situations where one wants to rank only acceptable candidates.Download Info
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.Bibliographic Info
Paper provided by Friedrich-Schiller-University Jena, Max-Planck-Institute of Economics in its series Jena Economic Research Papers with number 2011-020.Length:
Date of creation: 07 Apr 2011
Date of revision:
Handle: RePEc:jrp:jrpwrp:2011-020
Contact details of provider:
Postal: Carl-Zeiss-Strasse 3, 07743 JENA
Phone: +049 3641/ 9 43000
Fax: +049 3641/ 9 43000
Web page: http://www.jenecon.de
More information through EDIRC
Related research
Keywords: social ranking; fairness; fair game forms; objective equality; mechanism desig; committee decision making;Find related papers by JEL classification:
- C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
- D63 - Microeconomics - - Welfare Economics - - - Equity, Justice, Inequality, and Other Normative Criteria and Measurement
- D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
This paper has been announced in the following NEP Reports:
- NEP-ALL-2011-04-16 (All new papers)
- NEP-CDM-2011-04-16 (Collective Decision-Making)
- NEP-GTH-2011-04-16 (Game Theory)
References
References listed on IDEASPlease report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Guth, Werner & Peleg, Bezalel, 1996.
"On ring formation in auctions,"
Mathematical Social Sciences,
Elsevier, vol. 32(1), pages 1-37, August.
- Guth, W. & Peleg, B., 1993. "On Ring Formation in Auctions," Papers 9357, Tilburg - Center for Economic Research.
- Gueth, W. & Peleg, B., 1993. "On Ring Formation in Auctions," Discussion Paper 1993-57, Tilburg University, Center for Economic Research.
Citations
Lists
This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.Statistics
Access and download statisticsCorrections
When requesting a correction, please mention this item's handle: RePEc:jrp:jrpwrp:2011-020For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Markus Pasche).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.

