An official website of the United States government
ABSTRACT The citation of scientific papers is considered a simple and direct indicator of papers' impact. This paper predicts papers' citations through team‐related variables, team composition, and team structure. Team composition includes team size, male/female dominance, academia/industry collaboration, unique race number, and unique country number. Team structures are made up of team power level and team power hierarchy. Team members' previous citation number, H‐index, previous collaborators, career age, and previous paper numbers are a proxy of team power. We calculated the mean value and Gini coefficient to represent team power level (the collective team capability) and team power hierarchy (the vertical difference of power distribution within a team). Taking 1,675,035 CS teams in the DBLP dataset, we trained the XGBoost model to predict high/low citation. Our model has reached 0.71 in AUC and 70.45% in accuracy rate. Utilizing Explainable AI method SHAP to evaluate features' relative importance in predicting team citation categories, we found that team structure plays a more critical role than team composition in predicting team citation. High team power level, flat team power structure, diverse race background, large team, collaboration with industry, and male‐dominated teams can bring higher team citations. Our project can provide insights into how to form the best scientific teams and maximize team impact from team composition and team structure.
more »
« less
This content will become publicly available on May 1, 2026
Developing Team Ground Rules
Ground rules reflect what is important to team members about how they interact and can promote inclusion within the team
more »
« less
- Award ID(s):
- 2121930
- PAR ID:
- 10594179
- Publisher / Repository:
- Open Science Framework
- Date Published:
- Page Range / eLocation ID:
- DOI 10.17605/OSF.IO/AR8WG
- Subject(s) / Keyword(s):
- Compensation higher education faculty
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Teams can be often viewed as a dynamic system where the team configuration evolves over time (e.g., new members join the team; existing members leave the team; the skills of the members improve over time). Consequently, the performance of the team might be changing due to such team dynamics. A natural question is how to plan the (re-)staffing actions (e.g., recruiting a new team member) at each time step so as to maximize the expected cumulative performance of the team. In this paper, we address the problem of real-time team optimization by intelligently selecting the best candidates towards increasing the similarity between the current team and the high-performance teams according to the team configuration at each time-step. The key idea is to formulate it as a Markov Decision process (MDP) problem and leverage recent advances in reinforcement learning to optimize the team dynamically. The proposed method bears two main advantages, including (1) dynamics, being able to model the dynamics of the team to optimize the initial team towards the direction of a high-performance team via performance feedback; (2) efficacy, being able to handle the large state/action space via deep reinforcement learning based value estimation. We demonstrate the effectiveness of the proposed method through extensive empirical evaluations.more » « less
-
In this paper, we study the team expansion problem in collaborative environments where people collaborate with each other in the form of a team, which might need to be expanded frequently by having additional team members during the course of the project. Intuitively, there are three factors as well as the interactions between them that have a profound impact on the performance of the expanded team, including (1) the task the team is performing, (2) the existing team members, and (3) the new candidate team member. However, the vast majority of the existing work either considers these factors separately, or even ignores some of these factors. In this paper, we propose a neural network based approach TECE to simultaneously model the interactions between the team task, the team members as well as the candidate team members. Experimental evaluations on real-world datasets demonstrate the effectiveness of the proposed approach.more » « less
-
Driven by views of teams as dynamic systems with permeable boundaries, scholars are increasingly seeking to better understand how team membership changes (i.e., team members joining and/or leaving) shape the functioning and performance of organizational teams. However, empirical studies of team membership change appear to be progressing in three largely independent directions as researchers consider: (a) how newcomers impact and are impacted by the teams they join; (b) how teams adapt to member departures; or (c) how teams function under conditions of high membership fluidity, with little theoretical integration or consensus across these three areas. To accelerate an integrative stream of research on team membership change, we advance a conceptual framework which depicts each team membership change as a discrete team-level “event” which shapes team functioning to the extent to which it is “novel,” “disruptive,” and “critical” for the team. We use this framework to guide our review and synthesis of empirical studies of team membership change published over the past 20 years. Our review reveals numerous factors, across conceptual levels of the organization, that determine the strength (i.e., novelty, disruptiveness, criticality) of a team membership change event and, consequently, its impact on team functioning and performance. In closing, we provide propositions for future research that integrate a multilevel, event-based perspective of team membership change and demonstrate how team membership change events may impact organizational systems over time and across levels of observation.more » « less
-
Team-PSRO for Learning Approximate TMECor in Large Team Games via Cooperative Reinforcement LearningRecent algorithms have achieved superhuman performance at a number of twoplayer zero-sum games such as poker and go. However, many real-world situations are multi-player games. Zero-sum two-team games, such as bridge and football, involve two teams where each member of the team shares the same reward with every other member of that team, and each team has the negative of the reward of the other team. A popular solution concept in this setting, called TMECor, assumes that teams can jointly correlate their strategies before play, but are not able to communicate during play. This setting is harder than two-player zerosum games because each player on a team has different information and must use their public actions to signal to other members of the team. Prior works either have game-theoretic guarantees but only work in very small games, or are able to scale to large games but do not have game-theoretic guarantees. In this paper we introduce two algorithms: Team-PSRO, an extension of PSRO from twoplayer games to team games, and Team-PSRO Mix-and-Match which improves upon Team PSRO by better using population policies. In Team-PSRO, in every iteration both teams learn a joint best response to the opponent’s meta-strategy via reinforcement learning. As the reinforcement learning joint best response approaches the optimal best response, Team-PSRO is guaranteed to converge to a TMECor. In experiments on Kuhn poker and Liar’s Dice, we show that a tabular version of Team-PSRO converges to TMECor, and a version of Team PSRO using deep cooperative reinforcement learning beats self-play reinforcement learning in the large game of Google Research Football.more » « less
