About us
Our Mission
Teamusly helps create cohesive groups based on mutual preferences. We believe that when people can express who they'd like to work with, groups become more effective, engaged, and harmonious.
How It Works
Participants privately submit their preferences for who they'd like to collaborate with. Our algorithm uses sociometric principles to form groups that maximize mutual connections and cohesion, ensuring everyone ends up in a group they're happy with.
Algorithm & Research
Teamusly is built on the foundation of sociometry, a field pioneered by Jacob L. Moreno in the 1930s. Our grouping algorithm implements Moreno's sociometric principles to measure and maximize group cohesion.
Key References:
Moreno, J. L. (1934). Who Shall Survive? A New Approach to the Problem of Human Interrelations. Nervous and Mental Disease Publishing Company.
Moreno, J. L. (1953). Who Shall Survive? Foundations of Sociometry, Group Psychotherapy, and Sociodrama (2nd ed.). Beacon House.
Moreno, J. L. (1951). Sociometry, Experimental Method and the Science of Society: An Approach to a New Political Orientation. Beacon House.
Who are we
We are uncle and nephew: Silvio Cazzoletti and Luca Herranz-Celotti—a teacher and a researcher. Silvio saw other teachers struggling to make kids enjoy working in groups, but he knew better, he had his Moreno spreadsheets. However, it often felt like a daunting process to manually create those spreadsheets each time. Luca saw he could help by turning the technique into an app. That's why uncle and nephew joined forces, to make it easy for everybody to create groups that work.
Sociometric Principles
Our algorithm uses several key sociometric concepts:
• Mutual choices: When two people select each other
• Cohesion index: A measure of group interconnectedness
• In-degree centrality: How many times someone is chosen by others
• Weighted preferences: Higher scores for top-ranked choices
Privacy & Ethics
We take privacy seriously. Participant preferences are kept private and are only visible to organizers when explicitly permitted. The algorithm respects your choices while working to create the most cohesive groups possible.