Coalition Structure Generation with the graphics processing unit

Krzysztof Pawłowski, Karol Kurach, Kim Svensson, Sarvapali Ramchurn, Tomasz P. Michalak, Talal Rahwan

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    Coalition Structure Generation-the problem of finding the optimal division of agents into coalitions-has received considerable attention in recent AI literature. The fastest exact algorithm to solve this problem is IDP-IP [17], which is a hybrid of two previous algorithms, namely IDP and IP. Given this, it is desirable to speed up IDP as this will, in turn, improve upon the state-of-the-art. In this paper, we present IDPG-the first coalition structure generation algorithm based on the Graphics Processing Unit (GPU). This follows a promising, new algorithm design paradigm that can provide significant speedups. We show that IDPG is faster than IDP by two orders of magnitude.

    Original languageEnglish (US)
    Title of host publication13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014
    PublisherInternational Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
    Pages293-300
    Number of pages8
    Volume1
    ISBN (Electronic)9781634391313
    StatePublished - Jan 1 2014
    Event13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014 - Paris, France
    Duration: May 5 2014May 9 2014

    Other

    Other13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014
    CountryFrance
    CityParis
    Period5/5/145/9/14

    Fingerprint

    Graphics processing unit

    Keywords

    • Coalition Structure Generation
    • Dynamic programming
    • GPU

    ASJC Scopus subject areas

    • Artificial Intelligence

    Cite this

    Pawłowski, K., Kurach, K., Svensson, K., Ramchurn, S., Michalak, T. P., & Rahwan, T. (2014). Coalition Structure Generation with the graphics processing unit. In 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014 (Vol. 1, pp. 293-300). International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS).

    Coalition Structure Generation with the graphics processing unit. / Pawłowski, Krzysztof; Kurach, Karol; Svensson, Kim; Ramchurn, Sarvapali; Michalak, Tomasz P.; Rahwan, Talal.

    13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014. Vol. 1 International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2014. p. 293-300.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Pawłowski, K, Kurach, K, Svensson, K, Ramchurn, S, Michalak, TP & Rahwan, T 2014, Coalition Structure Generation with the graphics processing unit. in 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014. vol. 1, International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), pp. 293-300, 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014, Paris, France, 5/5/14.
    Pawłowski K, Kurach K, Svensson K, Ramchurn S, Michalak TP, Rahwan T. Coalition Structure Generation with the graphics processing unit. In 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014. Vol. 1. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS). 2014. p. 293-300
    Pawłowski, Krzysztof ; Kurach, Karol ; Svensson, Kim ; Ramchurn, Sarvapali ; Michalak, Tomasz P. ; Rahwan, Talal. / Coalition Structure Generation with the graphics processing unit. 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014. Vol. 1 International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2014. pp. 293-300
    @inproceedings{71a9e859cadf45739f42bb7574fd0299,
    title = "Coalition Structure Generation with the graphics processing unit",
    abstract = "Coalition Structure Generation-the problem of finding the optimal division of agents into coalitions-has received considerable attention in recent AI literature. The fastest exact algorithm to solve this problem is IDP-IP∗ [17], which is a hybrid of two previous algorithms, namely IDP and IP. Given this, it is desirable to speed up IDP as this will, in turn, improve upon the state-of-the-art. In this paper, we present IDPG-the first coalition structure generation algorithm based on the Graphics Processing Unit (GPU). This follows a promising, new algorithm design paradigm that can provide significant speedups. We show that IDPG is faster than IDP by two orders of magnitude.",
    keywords = "Coalition Structure Generation, Dynamic programming, GPU",
    author = "Krzysztof Pawłowski and Karol Kurach and Kim Svensson and Sarvapali Ramchurn and Michalak, {Tomasz P.} and Talal Rahwan",
    year = "2014",
    month = "1",
    day = "1",
    language = "English (US)",
    volume = "1",
    pages = "293--300",
    booktitle = "13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014",
    publisher = "International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)",

    }

    TY - GEN

    T1 - Coalition Structure Generation with the graphics processing unit

    AU - Pawłowski, Krzysztof

    AU - Kurach, Karol

    AU - Svensson, Kim

    AU - Ramchurn, Sarvapali

    AU - Michalak, Tomasz P.

    AU - Rahwan, Talal

    PY - 2014/1/1

    Y1 - 2014/1/1

    N2 - Coalition Structure Generation-the problem of finding the optimal division of agents into coalitions-has received considerable attention in recent AI literature. The fastest exact algorithm to solve this problem is IDP-IP∗ [17], which is a hybrid of two previous algorithms, namely IDP and IP. Given this, it is desirable to speed up IDP as this will, in turn, improve upon the state-of-the-art. In this paper, we present IDPG-the first coalition structure generation algorithm based on the Graphics Processing Unit (GPU). This follows a promising, new algorithm design paradigm that can provide significant speedups. We show that IDPG is faster than IDP by two orders of magnitude.

    AB - Coalition Structure Generation-the problem of finding the optimal division of agents into coalitions-has received considerable attention in recent AI literature. The fastest exact algorithm to solve this problem is IDP-IP∗ [17], which is a hybrid of two previous algorithms, namely IDP and IP. Given this, it is desirable to speed up IDP as this will, in turn, improve upon the state-of-the-art. In this paper, we present IDPG-the first coalition structure generation algorithm based on the Graphics Processing Unit (GPU). This follows a promising, new algorithm design paradigm that can provide significant speedups. We show that IDPG is faster than IDP by two orders of magnitude.

    KW - Coalition Structure Generation

    KW - Dynamic programming

    KW - GPU

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

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

    M3 - Conference contribution

    VL - 1

    SP - 293

    EP - 300

    BT - 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014

    PB - International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)

    ER -