摘要

To improve collaborative performance of social computing systems, this paper, which is based on multi-agent system model, defines agent collaboration length, agent collaboration resistance and multi-agent collaboration risk, and proposes a multiagent collaborative tree construction approach based on greedy algorithm, which determines collaborative relationships in the stable states for specific applications. Case analysis shows that the proposed approach can better reduce the multi-agent collaboration risks in social computing.

全文