Optimal sorting in group contests with complementarities
Philip Brookins,
John Lightle and
Dmitry Ryvkin
Journal of Economic Behavior & Organization, 2015, vol. 112, issue C, 311-323
Abstract:
Contests between groups of workers are often used to create incentives in organizations. Managers can sort workers into groups in various ways in order to maximize total output. We explore how the optimal sorting of workers by ability in such environments depends on the degree of effort complementarity within groups. For moderately steep costs of effort, we find that the optimal sorting is balanced (i.e., minimizing the variance in ability between groups) when complementarity is weak, and unbalanced (i.e., maximizing the variance in ability) when complementarity is strong. However, when the cost of effort is sufficiently steep, the optimal sorting can be unbalanced for all levels of complementarity or even alternate between unbalanced and balanced as the level of complementarity increases.
Keywords: Group contest; Complementarity; Sorting; Heterogeneity (search for similar items in EconPapers)
JEL-codes: C02 C72 D72 M54 (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (12)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167268115000414
Full text for ScienceDirect subscribers only
Related works:
Working Paper: Optimal sorting in group contests with complementarities (2014) 
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:jeborg:v:112:y:2015:i:c:p:311-323
DOI: 10.1016/j.jebo.2015.02.006
Access Statistics for this article
Journal of Economic Behavior & Organization is currently edited by Houser, D. and Puzzello, D.
More articles in Journal of Economic Behavior & Organization from Elsevier
Bibliographic data for series maintained by Catherine Liu ().