The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Group Role Assignment via a Kuhn–Munkres Algorithm-Based Solution
Abstract
Role assignment is a critical task in role-based collaboration. It has three steps, i.e., agent evaluation, group role assignment, and role transfer, where group role assignment is a time-consuming process. This paper clarifies the group role assignment problem (GRAP), describes a general assignment problem (GAP), converts a GRAP to a GAP, proposes an efficient algorithm based on the Kuhn-Munkres (K-M) algorithm, conducts numerical experiments, and analyzes the solutions' performances. The results show that the proposed algorithm significantly improves the algorithm based on exhaustive search. The major contributions of this paper include formally defining the GRAPs, giving a general efficient solution for them, and expanding the application scope of the K-M algorithm. This paper offers an efficient enough solution based on the K-M algorithm that outperforms significantly the exhaustive search approach.
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
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
Algorithms for the Assignment and Transportation Problems
Munkres, J. (1957) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0105003 · Cited by 3,986
The weighted sum method for multi-objective optimization: new insights
Marler, R. T., & Arora, J. S. (2010) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-009-0460-7 · Cited by 1,841
Work Role Transitions: A Study of American Expatriate Managers in Japan
Black, J. S. (1988) · Journal of International Business Studies · doi:10.1057/palgrave.jibs.8490383 · Cited by 1,117
Role Transitions in Organizational Life: An Identity-Based Perspective
Dukerich, J. M., & Ashforth, B. E. (2001) · The Academy of Management Review · doi:10.2307/3560250 · Cited by 832
Approximate graph edit distance computation by means of bipartite graph matching
Riesen, K., & Bunke, H. (2009) · Image and Vision Computing · doi:10.1016/j.imavis.2008.04.004 · Cited by 651
Dukerich, J. M. (2001) · Academy of Management Review · doi:10.5465/amr.2001.5393915 · Cited by 606
The Design of a Dynamic Emergency Response Management Information System (DERMIS)
Turoff, M., Chumer, M. J., de Walle, B. V., & Yao, X. (2004) · Journal of the Association for Information Systems · Cited by 553
An extension of the Munkres algorithm for the assignment problem to rectangular matrices
Bourgeois, F., & Lassalle, J.-C. (1971) · Communications of the ACM · doi:10.1145/362919.362945 · Cited by 501
Stone, P., & Veloso, M. (1999) · Artificial Intelligence · doi:10.1016/s0004-3702(99)00025-9 · Cited by 436
A new algorithm for the assignment problem
Bertsekas, D. P. (1981) · Mathematical Programming · doi:10.1007/bf01584237 · Cited by 292
Bostrom, R. P. (1980) · doi:10.1145/800085.802734 · Cited by 66
Incremental assignment problem
Toroslu, İ. H., & Üçoluk, G. (2006) · Information Sciences · doi:10.1016/j.ins.2006.05.004 · Cited by 54
Cited by
Decentralized Quality of Service Based System for Energy Trading Among Electric Vehicles
Al-Obaidi, A. A., & Farag, H. E. Z. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2021.3058514 · Cited by 35
Deep learning reveals many more inter-protein residue-residue contacts than direct coupling analysis
Zhou, T.-M., Wang, S., & Xu, J. (2017) · doi:10.1101/240754 · Cited by 25
Metadata
- Authors
- Zhu, H., Zhou, M., & Alkins, R.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
- Published
- 2012-05
- Volume
- 42
- Issue
- 3
- Pages
- 739-750
- ISSN
- 1083-4427 (ISSN-L)
- 1558-2426
- OpenAlex
- W2077297105
- Cited by
- 341
- References
- 13
- FWCI
- 25.76
- Type
- journal article
- 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
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.