Group role assignment via a Kuhn-Munkres algorithm-based solution

Document Type

Article

Publication Date

5-1-2012

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. © 2012 IEEE.

Identifier

84860161434 (Scopus)

Publication Title

IEEE Transactions on Systems Man and Cybernetics Part A Systems and Humans

External Full Text Location

https://doi.org/10.1109/TSMCA.2011.2170414

ISSN

10834427

First Page

739

Last Page

750

Issue

3

Volume

42

Grant

262075-06

Fund Ref

International Business Machines Corporation

This document is currently not available here.

Share

COinS