Output details
11 - Computer Science and Informatics
University of Oxford
Ranking games that have competitiveness-based strategies
<12>
There is a large literature in Economics on contests, in which competitors are ranked on some measure of output, and are awarded prizes based on their relative performance. This paper is the first to study contests in the Computer Science context. We develop the first polynomial-time algorithms that compute Nash equilibria of contests. The work is applicable to the design of incentive schemes and competitions. Nash equilibria are the natural outcomes of such competitions. A preliminary version appeared in the proceedings of the 2010 ACM-EC conference, the most competitive conference at the intersection of economics and computer science.