Terminal Ranking Games
Optimization and Control
2020-06-23 v2 Probability
Abstract
We analyze a mean field tournament: a mean field game in which the agents receive rewards according to the ranking of the terminal value of their projects and are subject to cost of effort. Using Schr\"{o}dinger bridges we are able to explicitly calculate the equilibrium. This allows us to identify the reward functions which would yield a desired equilibrium and solve several related mechanism design problems. We are also able to identify the effect of reward inequality on the players' welfare as well as calculate the price of anarchy.
Cite
@article{arxiv.1906.09628,
title = {Terminal Ranking Games},
author = {Erhan Bayraktar and Yuchong Zhang},
journal= {arXiv preprint arXiv:1906.09628},
year = {2020}
}
Comments
To appear in Mathematics of Operations Research