{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T15:55:50Z","timestamp":1765554950237,"version":"3.41.0"},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"3-4","license":[{"start":{"date-parts":[[2018,10,23]],"date-time":"2018-10-23T00:00:00Z","timestamp":1540252800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Facebook Faculty Research"},{"name":"ARO MURI"},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["IIS-0910664"],"award-info":[{"award-number":["IIS-0910664"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Simons Investigator Award"},{"name":"Google Research"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Econ. Comput."],"published-print":{"date-parts":[[2018,11,30]]},"abstract":"<jats:p>\n            Team performance is a ubiquitous area of inquiry in the social sciences, and it motivates the problem of\n            <jats:italic>team selection<\/jats:italic>\n            \u2014choosing 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 \u201cpotential\u201d 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\n            <jats:italic>no<\/jats:italic>\n            test applied to individuals can produce near-optimal teams, and we discuss implications for submodular maximization via hill-climbing.\n          <\/jats:p>","DOI":"10.1145\/3274644","type":"journal-article","created":{"date-parts":[[2018,10,23]],"date-time":"2018-10-23T12:16:16Z","timestamp":1540296976000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Team Performance with Test Scores"],"prefix":"10.1145","volume":"6","author":[{"given":"Jon","family":"Kleinberg","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maithra","family":"Raghu","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,10,23]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1468-0262.2006.00709.x"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100011464"},{"volume-title":"Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. SIAM","author":"Daskalakis C.","key":"e_1_2_1_3_1"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214042"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"H. A. David and H. N. Nagaraja. 2003. Order Statistics (3rd edition). Wiley.  H. A. David and H. N. Nagaraja. 2003. Order Statistics (3rd edition). Wiley.","DOI":"10.1002\/0471722162"},{"key":"e_1_2_1_6_1","unstructured":"A. Elo. 1978. The Rating of Chess Players Past and Present. Ishi Press.  A. Elo. 1978. The Rating of Chess Players Past and Present. Ishi Press."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.32"},{"volume-title":"Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. 535--544","author":"Goemans M. X.","key":"e_1_2_1_8_1"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1037\/0021-9010.87.5.819"},{"volume-title":"Proceedings of the 19th Advances in Neural Information Processing Systems. 569--576","author":"Herbrich R.","key":"e_1_2_1_10_1"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0403723101"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177703732"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/orsc.1090.0491"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1529-1006.2006.00030.x"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.2495"},{"volume-title":"Scientia Sinica 10","year":"1961","author":"Li-Chien C.","key":"e_1_2_1_16_1"},{"volume-title":"Proceedings of the 23rd International Joint Conference on Artificial Intelligence.","author":"Marcolino L. S.","key":"e_1_2_1_17_1"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1177\/104649640103200604"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.3.3.177"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830282"},{"key":"e_1_2_1_21_1","doi-asserted-by":"crossref","unstructured":"S. Trybula. 1965. On the paradox of n random variables. Zastos. Mat. 8 (1965) 143--154.  S. Trybula. 1965. On the paradox of n random variables. Zastos. Mat. 8 (1965) 143--154.","DOI":"10.4064\/am-8-2-143-156"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177703585"},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","unstructured":"S. Wuchty B. F. Jones and B. Uzzi. 2007. The increasing dominance of teams in production of knowledge. Science 316 5827 (2007) 1036--1039.  S. Wuchty B. F. Jones and B. Uzzi. 2007. The increasing dominance of teams in production of knowledge. Science 316 5827 (2007) 1036--1039.","DOI":"10.1126\/science.1136099"}],"container-title":["ACM Transactions on Economics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3274644","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3274644","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3274644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:55Z","timestamp":1750208275000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3274644"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,23]]},"references-count":23,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2018,11,30]]}},"alternative-id":["10.1145\/3274644"],"URL":"https:\/\/doi.org\/10.1145\/3274644","relation":{},"ISSN":["2167-8375","2167-8383"],"issn-type":[{"type":"print","value":"2167-8375"},{"type":"electronic","value":"2167-8383"}],"subject":[],"published":{"date-parts":[[2018,10,23]]},"assertion":[{"value":"2017-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-10-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}