Contests on Networks

36 Pages Posted: 25 May 2018

See all articles by Alexander Matros

Alexander Matros

Moore School of Business

David Rietzke

Lancaster University

Date Written: May 4, 2018

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 the Tullock contest success function and explore how behavior depends on the pattern of interactions. Additionally, we show that many well-known results from the contest literature can be obtained by varying the structure of the network. Our framework has a broad range of applications, including research and development, advertising, and research funding.

Keywords: Network Games, Contests, Exclusion Principle, Bipartite Graph, Tullock Contest

JEL Classification: C72, D70, D85

Suggested Citation

Matros, Alexander and Rietzke, David, Contests on Networks (May 4, 2018). Available at SSRN: https://ssrn.com/abstract=3179547 or http://dx.doi.org/10.2139/ssrn.3179547

Alexander Matros

Moore School of Business ( email )

1014 Greene St
Columbia, SC 29208
United States

David Rietzke (Contact Author)

Lancaster University ( email )

Lancaster LA1 4YX
United Kingdom

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
61
Abstract Views
379
rank
408,018
PlumX Metrics