DETERMINATION OF SOCIAL LAWS FOR MULTIAGENT MOBILIZATION

In previous work on artificial social systems, social laws for multi-a gent 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 env ironment. 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 fi nding a routing in a graph. Then we show that any given 2-connected gr aph has a routing which can be efficiently constructed, yielding the d esired social law for multi-agent mobilization on the given graph. (C) 1997 Elsevier Science B.V.