An algorithm for distributing coalitional value calculations among cooperating agents

Talal Rahwan, Nicholas R. Jennings

    Research output: Contribution to journalArticle

    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).

    Original languageEnglish (US)
    Pages (from-to)535-567
    Number of pages33
    JournalArtificial Intelligence
    Volume171
    Issue number8-9
    DOIs
    StatePublished - Jun 1 2007

    Fingerprint

    coalition
    Values
    Data storage equipment
    Software agents
    redundancy
    Redundancy
    communication
    Communication
    resources
    Computational
    software
    literature
    time

    Keywords

    • Coalition formation
    • Multi-agent systems

    ASJC Scopus subject areas

    • Artificial Intelligence
    • Computational Theory and Mathematics

    Cite this

    An algorithm for distributing coalitional value calculations among cooperating agents. / Rahwan, Talal; Jennings, Nicholas R.

    In: Artificial Intelligence, Vol. 171, No. 8-9, 01.06.2007, p. 535-567.

    Research output: Contribution to journalArticle

    Rahwan, Talal ; Jennings, Nicholas R. / An algorithm for distributing coalitional value calculations among cooperating agents. In: Artificial Intelligence. 2007 ; Vol. 171, No. 8-9. pp. 535-567.
    @article{2113a16e013f46e185e58ec2a02d5f1f,
    title = "An algorithm for distributing coalitional value calculations among cooperating agents",
    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).",
    keywords = "Coalition formation, Multi-agent systems",
    author = "Talal Rahwan and Jennings, {Nicholas R.}",
    year = "2007",
    month = "6",
    day = "1",
    doi = "10.1016/j.artint.2007.03.002",
    language = "English (US)",
    volume = "171",
    pages = "535--567",
    journal = "Artificial Intelligence",
    issn = "0004-3702",
    publisher = "Elsevier",
    number = "8-9",

    }

    TY - JOUR

    T1 - An algorithm for distributing coalitional value calculations among cooperating agents

    AU - Rahwan, Talal

    AU - Jennings, Nicholas R.

    PY - 2007/6/1

    Y1 - 2007/6/1

    N2 - 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).

    AB - 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).

    KW - Coalition formation

    KW - Multi-agent systems

    UR - http://www.scopus.com/inward/record.url?scp=34249661503&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=34249661503&partnerID=8YFLogxK

    U2 - 10.1016/j.artint.2007.03.002

    DO - 10.1016/j.artint.2007.03.002

    M3 - Article

    VL - 171

    SP - 535

    EP - 567

    JO - Artificial Intelligence

    JF - Artificial Intelligence

    SN - 0004-3702

    IS - 8-9

    ER -