Mathematics > Optimization and Control
[Submitted on 31 Oct 2018]
Title:Large Tournament Games
View PDFAbstract:We consider a stochastic tournament game in which each player is rewarded based on her rank in terms of the completion time of her own task and is subject to cost of effort. When players are homogeneous and the rewards are purely rank dependent, the equilibrium has a surprisingly explicit characterization, which allows us to conduct comparative statics and obtain explicit solution to several optimal reward design problems. In the general case when the players are heterogenous and payoffs are not purely rank dependent, we prove the existence, uniqueness and stability of the Nash equilibrium of the associated mean field game, and the existence of an approximate Nash equilibrium of the finite-player game. Our results have some potential economic implications; e.g., they lend support to government subsidies for R and D, assuming the profits to be made are substantial.
Current browse context:
math.OC
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.