Determination of social laws for multi-agent mobilization

摘要

In previous work on artificial social systems, social laws for multi-agent mobilization were handcrafted for particular network structures. In this work, we introduce an algorithm for the automatic synthesis of social laws for multi-agent mobilization in any 2-connected graph environment. We introduce the notion of a graph routing and show that the problem of computing a useful social law can be reduced to that of finding a routing in a graph. Then we show that any given 2-connected graph has a routing which can be efficiently constructed, yielding the desired social law for multi-agent mobilization on the given graph.