The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Online team formation in social networks
Abstract
We study the problem of online team formation. We consider a setting in which people possess different skills and compatibility among potential team members is modeled by a social network. A sequence of tasks arrives in an online fashion, and each task requires a specific set of skills. The goal is to form a new team upon arrival of each task, so that (i) each team possesses all skills required by the task, (ii) each team has small communication overhead, and (iii) the workload of performing the tasks is balanced among people in the fairest possible way.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Coase, R. H. (1937) · Economica · doi:10.1111/j.1468-0335.1937.tb00002.x · Cited by 23,972
(2011) · SpringerReference · doi:10.1007/springerreference_57547 · Cited by 3,190
Amortized efficiency of list update and paging rules
Sleator, D. D., & Tarjan, R. E. (1985) · Communications of the ACM · doi:10.1145/2786.2793 · Cited by 2,123
Finding a team of experts in social networks
Lappas, T., Liu, K., & Terzi, E. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557074 · Cited by 694
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Megiddo, N. (1983) · Journal of the ACM · doi:10.1145/2157.322410 · Cited by 626
On the approximability of trade-offs and optimal access of Web sources
Papadimitriou, C. H., & Yannakakis, M. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892068 · Cited by 458
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., & Waarts, O. (1997) · Journal of the ACM · doi:10.1145/258128.258201 · Cited by 330
The Competitiveness of On-Line Assignments
Azar, Y., Naor, J. S., & Rom, R. (1995) · Journal of Algorithms · doi:10.1006/jagm.1995.1008 · Cited by 241
Bounds on multiprocessing anomalies and related packing algorithms
Graham, R. L. (1971) · AFIPS Fall Joint Computer Conference (FJCC) · doi:10.1145/1478873.1478901 · Cited by 118
Composing Near-Optimal Expert Teams: A Trade-Off between Skills and Connectivity
Mayr‐Dorn, C., & Dustdar, S. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-16934-2_35 · Cited by 55
Cited by
Kittur, A., Nickerson, J. V., Bernstein, M., Gerber, E., Shaw, A., Zimmerman, J., Lease, M., & Horton, J. (2013) · Proceedings of the 2013 conference on Computer supported cooperative work · doi:10.1145/2441776.2441923 · Cited by 1,034
Metadata
- Authors
- Anagnostopoulos, A., Becchetti, L., Castillo, C., Gionis, A., & Leonardi, S.
- Venue
- Proceedings of the 21st international conference on World Wide Web
- Publisher
- ACM
- Published
- 2012-04-16
- Pages
- 839-848
- OpenAlex
- W2139257893
- Cited by
- 325
- References
- 10
- FWCI
- 19.39
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Online team formation in social networks. https://app.cochat.ai/papers/10.1145/2187836.2187950
- The paper
- Anagnostopoulos, A., Becchetti, L., Castillo, C., Gionis, A., & Leonardi, S. (2012). Online team formation in social networks. Proceedings of the 21st international conference on World Wide Web. https://doi.org/10.1145/2187836.2187950
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.