An Algorithm for Distributing Coalitional Value Calculations among Cooperating Agents

An Algorithm for Distributing Coalitional Value Calculations among Cooperating Agents

The process of forming coalitions of software agents generally requires calculating a value for every possible coalition which indicates how beneficial that coalition would be if it was formed. Now, instead of having a single agent calculate all these values (as is typically the case), it is more efficient to distribute this calculation among the agents, thus using all the computational resources available to the system and avoiding the existence of a single point of failure. Given this, we present a novel algorithm for distributing this calculation among agents in cooperative environments. Specifically, by using our algorithm, each agent is assigned some part of the calculation such that the agents’ shares are exhaustive and disjoint. Moreover, the algorithm is decentralized, requires no communication between the agents, has minimal memory requirements, and can reflect variations in the computational speeds of the agents. To evaluate the effectiveness of our algorithm, we compare it with the only other algorithm available in the literature for distributing the coalitional value calculations (due to Shehory and Kraus). This shows that for the case of 25 agents, the distribution process of our algorithm took less than 0.02% of the time, the values were calculated using 0.000006% of the memory, the calculation redundancy was reduced from 383229848 to 0, and the total number of bytes sent between the agents dropped from 1146989648 to 0 (note that for larger numbers of agents, these improvements become exponentially better).

535-567

Rahwan, Talal

476029f3-5484-4747-9f44-f63f3687083c

Jennings, N. R.

ab3d94cc-247c-4545-9d1e-65873d6cdb30

2007

Rahwan, Talal

476029f3-5484-4747-9f44-f63f3687083c

Jennings, N. R.

ab3d94cc-247c-4545-9d1e-65873d6cdb30

Rahwan, Talal and Jennings, N. R.
(2007)
An Algorithm for Distributing Coalitional Value Calculations among Cooperating Agents.
*Artificial Intelligence*, 171 (8-9), .

## Abstract

The process of forming coalitions of software agents generally requires calculating a value for every possible coalition which indicates how beneficial that coalition would be if it was formed. Now, instead of having a single agent calculate all these values (as is typically the case), it is more efficient to distribute this calculation among the agents, thus using all the computational resources available to the system and avoiding the existence of a single point of failure. Given this, we present a novel algorithm for distributing this calculation among agents in cooperative environments. Specifically, by using our algorithm, each agent is assigned some part of the calculation such that the agents’ shares are exhaustive and disjoint. Moreover, the algorithm is decentralized, requires no communication between the agents, has minimal memory requirements, and can reflect variations in the computational speeds of the agents. To evaluate the effectiveness of our algorithm, we compare it with the only other algorithm available in the literature for distributing the coalitional value calculations (due to Shehory and Kraus). This shows that for the case of 25 agents, the distribution process of our algorithm took less than 0.02% of the time, the values were calculated using 0.000006% of the memory, the calculation redundancy was reduced from 383229848 to 0, and the total number of bytes sent between the agents dropped from 1146989648 to 0 (note that for larger numbers of agents, these improvements become exponentially better).

## More information

Published date: 2007

Organisations:
Agents, Interactions & Complexity

## Identifiers

Local EPrints ID: 263720

URI: http://eprints.soton.ac.uk/id/eprint/263720

PURE UUID: 6ca08ca6-4dc1-465f-a445-e3975484ba08

## Catalogue record

Date deposited: 20 Mar 2007

Last modified: 25 Nov 2019 21:03

## Export record

## Contributors

Author:
Talal Rahwan

Author:
N. R. Jennings

## University divisions

## Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics