We consider large population Tullock contests in which agents are divided into different types according to their strategy cost function. A planner assigns type specific bias parameters to affect the likelihood of success with the objective of maximizing the Nash equilibrium level of aggregate...

We consider Tullock contests where contestants can be divided into a finite set of types according to their strategy cost function. Solving such contests is intractable if the number of players is finite but large and there are nonlinearities and asymmetries present. But by approximating the...