Abstract
We develop a model of contests on networks. Each player is connected to a set of contests, and exerts a single effort to increase the probability of winning each contest to which she is connected. We characterize equilibria under both the Tullock and all-pay auction contest success functions (CSFs), and show that many well-known results from the contest literature can be obtained by varying the structure of the network. We also obtain a new exclusion result: We show that, under both CSFs, equilibrium total effort may be higher when one player is excluded from the network. This finding contrasts the existing literature, which limits findings of this sort to the all-pay auction CSF. Our framework has a broad range of applications, including research and development, advertising, and research funding.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
