Team Performance with Test Scores

Team performance is a ubiquitous area of inquiry in the social sciences, and it motivates the problem of team selection—choosing the members of a team for maximum performance. Influential work of Hong and Page has argued that testing individuals in isolation and then assembling the highest scoring ones into a team is not an effective method for team selection. For a broad class of performance measures, based on the expected maximum of random variables representing individual candidates, we show that tests directly measuring individual performance are indeed ineffective, but that a more subtle family of tests used in isolation can provide a constant-factor approximation for team performance. These new tests measure the “potential” of individuals, in a precise sense, rather than performance; to our knowledge they represent the first time that individual tests have been shown to produce near-optimal teams for a nontrivial team performance measure. We also show families of subdmodular and supermodular team performance functions for which no test applied to individuals can produce near-optimal teams, and we discuss implications for submodular maximization via hill-climbing.

[1]  Frederick R. Forst,et al.  On robust estimation of the location parameter , 1980 .

[2]  S. Trybuła,et al.  On the paradox of n random variables , 1965 .

[3]  Laurence A. Wolsey,et al.  Best Algorithms for Approximating the Maximum of a Submodular Set Function , 1978, Math. Oper. Res..

[4]  Antoni Calvó-Armengol,et al.  Centre De Referència En Economia Analítica Barcelona Economics Working Paper Series Working Paper Nº 178 Who's Who in Networks. Wanted: the Key Player Who's Who in Networks. Wanted: the Key Player Barcelona Economics Wp Nº 178 , 2022 .

[5]  Eric Lonstein,et al.  Prize-based contests can provide solutions to computational biology problems , 2013, Nature Biotechnology.

[6]  Daniel R. Ilgen,et al.  Enhancing the Effectiveness of Work Groups and Teams , 2006, Psychological science in the public interest : a journal of the American Psychological Society.

[7]  Vahab S. Mirrokni,et al.  Approximating submodular functions everywhere , 2009, SODA.

[8]  Rocco A. Servedio,et al.  Learning Poisson Binomial Distributions , 2011, STOC '12.

[9]  Rocco A. Servedio,et al.  Learning k-Modal Distributions via Testing , 2012, Theory Comput..

[10]  Jan Vondrák,et al.  Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[11]  Lu Hong,et al.  Groups of diverse problem solvers can outperform groups of high-ability problem solvers. , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[12]  Kara A. Incalcaterra,et al.  A meta-analysis of team-efficacy, potency, and performance: interdependence and level of analysis as moderators of observed relationships. , 2002, The Journal of applied psychology.

[13]  W. Heath The Difference: How the Power of Diversity Creates Better Groups, Firms, Schools, and Societies , 2008 .

[14]  Karim R. Lakhani,et al.  Marginality and Problem-Solving Effectiveness in Broadcast Search , 2010, Organ. Sci..

[15]  Tom Minka,et al.  TrueSkillTM: A Bayesian Skill Rating System , 2006, NIPS.

[16]  Benjamin F. Jones,et al.  Supporting Online Material Materials and Methods Figs. S1 to S3 References the Increasing Dominance of Teams in Production of Knowledge , 2022 .

[17]  Zalman Usiskin Max-Min Probabilities in the Voting Paradox , 1964 .

[18]  Leandro Soriano Marcolino,et al.  Multi-Agent Team Formation: Diversity Beats Strength? , 2013, IJCAI.

[19]  Diane L. Miller,et al.  Reexamining Teamwork KSAs and Team Performance , 2001 .

[20]  G. Birkhoff,et al.  On the combination of subalgebras , 1933, Mathematical Proceedings of the Cambridge Philosophical Society.