Effort Maximization in Asymmetric N-Person Contest Games
31 Pages Posted: 12 Aug 2009
There are 2 versions of this paper
Effort Maximization in Asymmetric N-Person Contest Games
Effort Maximization in Asymmetric N-Person Contest Games
Date Written: August 2009
Abstract
This paper provides existence and characterization of the optimal contest success function under the condition that the objective of the contest designer is total effort maximization among n heterogeneous players. Heterogeneity of players makes active participation of a player in equilibrium endogenous with respect to the specific contest success function adopted by the contest designer. Hence, the aim of effort maximization implies the identification of those players who should be excluded from making positive efforts. We give a general proof for the existence of an optimal contest success function and provide an algorithm for the determination of the set of actively participating players. This is turn allows to determine optimal efforts in closed form. An important general feature of the solution is that maximization of total effort requires at least three players to be active.
Keywords: effort maximization, existence of solution, asymmetric contests, participation constraints
JEL Classification: C72, D72
Suggested Citation: Suggested Citation
Do you have negative results from your research you’d like to share?
Recommended Papers
-
Innovative Activity with Sunk Cost
By Todd R. Kaplan, Israel Luski, ...
-
All-Pay Auctions with Variable Rewards
By Todd R. Kaplan, Israel Luski, ...
-
Effort Maximization in Asymmetric N-Person Contest Games
By Jörg Franke, Christian Kanzow, ...
-
Rematches in Boxing and Other Sporting Events
By Edward Kutsoati and J. Atsu Amegashie
-
Politician Preferences and Caps on Political Lobbying
By Tuvana Pastine and Ivan Pastine
-
The Optimal Design of Rewards in Contests
By Todd R. Kaplan and David Wettstein
-
Competitive Balance in Olympic Boxing: 1904-2012
By David Chaplin and Sergio Mendoza