Title: Distributed Algorithms for Cooperating Agents

Author: Eric Werner and A. Reinefeld


Contact: eric.werner@cellnomica.com

Abstract

Distributed algorithms are presented that describe various degrees of cooperation between autonomous agents. The algorithms generate styles of cooperation that cover a whole spectrum, from total cooperation, to complete self-interest, to absolute antagonism, to complete self-destruction and every mixture of these. A classification of cooperation styles is described.
The algorithms act on the intentional states of the agents. To resolve goal conflicts, three compromise methods are considered: rank-based compromise using a simple ranking of goals, value-optimal compromise using costs and values with the branch-and-bound procedure, and a more efficient value-optimal compromise using a zero-one integer programming method that exploits goal dependencies.