Affiliation:
1. Cornell University, USA
2. Google Inc., USA
Abstract
We model and analyze cardinal contests, where a principal running a rank-order tournament has access to an absolute measure of the quality of agents’ submissions in addition to their relative rankings. We show that a mechanism that compares each agent’s output quality against a threshold to decide whether to award her the prize corresponding to her rank is optimal amongst the set of all mixed cardinal-ordinal mechanisms where the
j
th-ranked submission receives a fraction of the
j
th prize that is a non-decreasing function of the submission’s quality. Furthermore, the optimal threshold mechanism uses exactly the same threshold for each rank.
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Marketing,Economics and Econometrics,Statistics and Probability,Computer Science (miscellaneous)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献