Feasible Formation of Coalitions Among Autonomous Agents in Nonsuperadditive Environments

摘要: Cooperating and sharing resources by creating coalitions of agents are important ways for autonomous to execute tasks maximize payoff. Such will form only if each member a coalition gains more joining the than it could gain otherwise. There several such dividing joint payoff among members. In this paper we present algorithms formation distribution in nonsuperadditive environments. We focus on low-complexity kernel-oriented algorithm. The properties algorithm were examined via simulations. These have shown that model increases benefits within reasonable time period, formations provide agents.