Stability, Fairness and Scalability of Multi-Agent Systems
چکیده
We study a general network of agents that can be built with Zeus [?]. Relationships between agents can be peer, slave, master, discounter, or no relation at all. There are four possible strategies: the cheapest agent is selected, preference to slaves first, cut-price discounting based on the utility, and cheapest agent chosen, but preference given to cheapest slave. The cost of a task for the agent originating it, is the cost of the resources used. The size of the initial endowment is determined so that there are never any lost tasks in the system. We also establish the influence of agent strategies on stability and fairness. We were able to determine how much discounting the agents can allow, and how to control the coordination time. The growth of the maximum communication load with respect to the number of agents is calculated for various topologies of networks of agents. A performance measure related to the speed of the network is also calculated.