References (8)



Optimal Allocation of Heterogeneous Agents in Contests

Martin Grossmann

University of Zurich

Helmut M. Dietl

University of Zurich - Department of Business Administration (IBW)

September 28, 2007

In this paper, we discuss a manager's allocation problem. Two managers allocate their heterogeneous employees - each manager allocates two high types and two low types - in groups of two in order to compete for an exogenous contest prize in a two period model. There are three possibilities of groups' constellation depending on manager's allocation decision: Strong groups (two high types), balanced groups (one high and one low type) and weak groups (two low types). These allocations determine the managers' performance. We show that equilibria in a simultaneous as well as in a sequential game only depend on the difference of the heterogeneous groups' outputs. Furthermore, we show that there is no second mover advantage according this model. Therefore, firms' performances are independent of the model's timing. A typical application of the model fits to coaches' decisions in ice hockey concerning the optimal constellation of the first, second, third (and so forth) lines.

Number of Pages in PDF File: 25

Keywords: Contest, Sports

JEL Classification: L83

Open PDF in Browser Download This Paper

Date posted: October 1, 2007  

Suggested Citation

Grossmann, Martin and Dietl, Helmut M., Optimal Allocation of Heterogeneous Agents in Contests (September 28, 2007). Available at SSRN: http://ssrn.com/abstract=1017826 or http://dx.doi.org/10.2139/ssrn.1017826

Contact Information

Martin Grossmann (Contact Author)
University of Zurich ( email )
Plattenstrasse 14
CH-8032 Zürich, 8032
Helmut M. Dietl
University of Zurich - Department of Business Administration (IBW) ( email )
Hottingerstrasse 10
Plattenstrasse 14
Zurich, 8032
Feedback to SSRN

Paper statistics
Abstract Views: 309
Downloads: 66
Download Rank: 255,831
References:  8

© 2016 Social Science Electronic Publishing, Inc. All Rights Reserved.  FAQ   Terms of Use   Privacy Policy   Copyright   Contact Us
This page was processed by apollobot1 in 2.500 seconds