For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

University of Oxford

Return to search Previous output Next output
Output 0 of 0 in the submission
Article title

Ranking games that have competitiveness-based strategies

Type
D - Journal article
Title of journal
Theoretical Computer Science
Article number
C
Volume number
476
Issue number
-
First page of article
24
ISSN of journal
0304-3975
Year of publication
2013
Number of additional authors
3
Additional information

<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.

Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-