Near-optimal anytime coalition structure generation

Talal Rahwan, Sarvapali D. Ramchurn, Viet Dung Dang, Nicholas R. Jennings

    Research output: Contribution to journalConference article

    Abstract

    Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of determining the best set of agents that should participate in a given team. To this end, in this paper, we present a novel, anytime algorithm for coalition structure generation that is faster than previous anytime algorithms designed for this purpose. Our algorithm can generate solutions that either have a tight bound from the optimal or are optimal (depending on the objective) and works by partitioning the space in terms of a small set of elements that represent structures which contain coalitions of the same size. It then performs an online heuristic search that prunes the space and only considers valid and non-redundant coalition structures. We empirically show that we are able to find solutions that are, in the worst case, 99% efficient in 0.0129% of the time to find the optimal value by the state of the art dynamic programming algorithm (for 20 agents).

    Original languageEnglish (US)
    JournalCEUR Workshop Proceedings
    Volume223
    StatePublished - Dec 1 2006
    Event4th European Workshop on Multi-Agent Systems, EUMAS 2006 - Lisbon, Portugal
    Duration: Dec 14 2006Dec 15 2006

    Fingerprint

    Multi agent systems
    Dynamic programming

    ASJC Scopus subject areas

    • Computer Science(all)

    Cite this

    Rahwan, T., Ramchurn, S. D., Dang, V. D., & Jennings, N. R. (2006). Near-optimal anytime coalition structure generation. CEUR Workshop Proceedings, 223.

    Near-optimal anytime coalition structure generation. / Rahwan, Talal; Ramchurn, Sarvapali D.; Dang, Viet Dung; Jennings, Nicholas R.

    In: CEUR Workshop Proceedings, Vol. 223, 01.12.2006.

    Research output: Contribution to journalConference article

    Rahwan, T, Ramchurn, SD, Dang, VD & Jennings, NR 2006, 'Near-optimal anytime coalition structure generation', CEUR Workshop Proceedings, vol. 223.
    Rahwan T, Ramchurn SD, Dang VD, Jennings NR. Near-optimal anytime coalition structure generation. CEUR Workshop Proceedings. 2006 Dec 1;223.
    Rahwan, Talal ; Ramchurn, Sarvapali D. ; Dang, Viet Dung ; Jennings, Nicholas R. / Near-optimal anytime coalition structure generation. In: CEUR Workshop Proceedings. 2006 ; Vol. 223.
    @article{adc2eb69eda64cf6920a62f32a338fa8,
    title = "Near-optimal anytime coalition structure generation",
    abstract = "Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of determining the best set of agents that should participate in a given team. To this end, in this paper, we present a novel, anytime algorithm for coalition structure generation that is faster than previous anytime algorithms designed for this purpose. Our algorithm can generate solutions that either have a tight bound from the optimal or are optimal (depending on the objective) and works by partitioning the space in terms of a small set of elements that represent structures which contain coalitions of the same size. It then performs an online heuristic search that prunes the space and only considers valid and non-redundant coalition structures. We empirically show that we are able to find solutions that are, in the worst case, 99{\%} efficient in 0.0129{\%} of the time to find the optimal value by the state of the art dynamic programming algorithm (for 20 agents).",
    author = "Talal Rahwan and Ramchurn, {Sarvapali D.} and Dang, {Viet Dung} and Jennings, {Nicholas R.}",
    year = "2006",
    month = "12",
    day = "1",
    language = "English (US)",
    volume = "223",
    journal = "CEUR Workshop Proceedings",
    issn = "1613-0073",

    }

    TY - JOUR

    T1 - Near-optimal anytime coalition structure generation

    AU - Rahwan, Talal

    AU - Ramchurn, Sarvapali D.

    AU - Dang, Viet Dung

    AU - Jennings, Nicholas R.

    PY - 2006/12/1

    Y1 - 2006/12/1

    N2 - Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of determining the best set of agents that should participate in a given team. To this end, in this paper, we present a novel, anytime algorithm for coalition structure generation that is faster than previous anytime algorithms designed for this purpose. Our algorithm can generate solutions that either have a tight bound from the optimal or are optimal (depending on the objective) and works by partitioning the space in terms of a small set of elements that represent structures which contain coalitions of the same size. It then performs an online heuristic search that prunes the space and only considers valid and non-redundant coalition structures. We empirically show that we are able to find solutions that are, in the worst case, 99% efficient in 0.0129% of the time to find the optimal value by the state of the art dynamic programming algorithm (for 20 agents).

    AB - Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of determining the best set of agents that should participate in a given team. To this end, in this paper, we present a novel, anytime algorithm for coalition structure generation that is faster than previous anytime algorithms designed for this purpose. Our algorithm can generate solutions that either have a tight bound from the optimal or are optimal (depending on the objective) and works by partitioning the space in terms of a small set of elements that represent structures which contain coalitions of the same size. It then performs an online heuristic search that prunes the space and only considers valid and non-redundant coalition structures. We empirically show that we are able to find solutions that are, in the worst case, 99% efficient in 0.0129% of the time to find the optimal value by the state of the art dynamic programming algorithm (for 20 agents).

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

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

    M3 - Conference article

    VL - 223

    JO - CEUR Workshop Proceedings

    JF - CEUR Workshop Proceedings

    SN - 1613-0073

    ER -