Effective Approaches to Adaptive Collaboration via Dynamic Role Assignment

Abstract

Adaptive collaboration (AC) is essential for group performance optimization in collaborative systems. This paper begins by introducing AC within the context of solving a real-world problem. Next, AC problems are formalized based on the environment-class, agent, role, group, and object (E-CARGO) model. Three algorithms are proposed for solving AC problems. They are based on three different scenarios: 1) the current group state (GS); 2) the GS after a specific period; and 3) the GS throughout the collaboration. More complex AC problems and their solutions are then investigated. Derived from the above-mentioned algorithms, two additional algorithms are presented. They consider reassignment costs. Experiments are developed to analyze the performance of each proposed algorithm. Results indicate that the proposed algorithms perform better than static collaboration where there are no reassignment costs. If reassignment costs exist, we also provide a way of determining whether to adopt an AC approach. This paper provides insights into the AC process and its effectiveness in various scenarios.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 64 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.