2000 character limit reached
A Mean Field Competition (1708.01308v1)
Published 3 Aug 2017 in math.OC, math.PR, and q-fin.EC
Abstract: We introduce a mean field game with rank-based reward: competing agents optimize their effort to achieve a goal, are ranked according to their completion time, and paid a reward based on their relative rank. First, we propose a tractable Poissonian model in which we can describe the optimal effort for a given reward scheme. Second, we study the principal--agent problem of designing an optimal reward scheme. A surprising, explicit design is found to minimize the time until a given fraction of the population has reached the goal.