Anytime optimal coalition structure generation

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

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

Abstract

A key problem when forming effective coalitions of autonomous agents is determining the best groupings, or the optimal coalition structure, to select to achieve some goal. To this end, we present a novel, anytime algorithm for this task that is significantly faster than current solutions. Specifically, we empirically show that we are able to find solutions that are optimal in 0.082% of the time taken by the state of the art dynamic programming algorithm (for 27 agents), using much less memory (O(2n) instead of 0(3n) for n agents). Moreover, our algorithm is the first to be able to find solutions for more than 17 agents in reasonable time (less than 90 minutes for 27 agents, as opposed to around 2 months for the best previous solution).

Original languageEnglish (US)
Title of host publicationAAAI-07/IAAI-07 Proceedings
Subtitle of host publication22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference
Pages1184-1190
Number of pages7
Volume2
StatePublished - Nov 28 2007
EventAAAI-07/IAAI-07 Proceedings: 22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference - Vancouver, BC, Canada
Duration: Jul 22 2007Jul 26 2007

Other

OtherAAAI-07/IAAI-07 Proceedings: 22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference
CountryCanada
CityVancouver, BC
Period7/22/077/26/07

Fingerprint

Autonomous agents
Dynamic programming
Data storage equipment

ASJC Scopus subject areas

  • Software

Cite this

Rahwan, T., Ramchurn, S. D., Dang, V. D., Giovannucci, A., & Jennings, N. R. (2007). Anytime optimal coalition structure generation. In AAAI-07/IAAI-07 Proceedings: 22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference (Vol. 2, pp. 1184-1190)

Anytime optimal coalition structure generation. / Rahwan, Talal; Ramchurn, Sarvapali D.; Dang, Viet D.; Giovannucci, Andrea; Jennings, Nicholas R.

AAAI-07/IAAI-07 Proceedings: 22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference. Vol. 2 2007. p. 1184-1190.

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

Rahwan, T, Ramchurn, SD, Dang, VD, Giovannucci, A & Jennings, NR 2007, Anytime optimal coalition structure generation. in AAAI-07/IAAI-07 Proceedings: 22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference. vol. 2, pp. 1184-1190, AAAI-07/IAAI-07 Proceedings: 22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference, Vancouver, BC, Canada, 7/22/07.
Rahwan T, Ramchurn SD, Dang VD, Giovannucci A, Jennings NR. Anytime optimal coalition structure generation. In AAAI-07/IAAI-07 Proceedings: 22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference. Vol. 2. 2007. p. 1184-1190
Rahwan, Talal ; Ramchurn, Sarvapali D. ; Dang, Viet D. ; Giovannucci, Andrea ; Jennings, Nicholas R. / Anytime optimal coalition structure generation. AAAI-07/IAAI-07 Proceedings: 22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference. Vol. 2 2007. pp. 1184-1190
@inproceedings{2f7cfd4b337b47c5b98504a73cb86409,
title = "Anytime optimal coalition structure generation",
abstract = "A key problem when forming effective coalitions of autonomous agents is determining the best groupings, or the optimal coalition structure, to select to achieve some goal. To this end, we present a novel, anytime algorithm for this task that is significantly faster than current solutions. Specifically, we empirically show that we are able to find solutions that are optimal in 0.082{\%} of the time taken by the state of the art dynamic programming algorithm (for 27 agents), using much less memory (O(2n) instead of 0(3n) for n agents). Moreover, our algorithm is the first to be able to find solutions for more than 17 agents in reasonable time (less than 90 minutes for 27 agents, as opposed to around 2 months for the best previous solution).",
author = "Talal Rahwan and Ramchurn, {Sarvapali D.} and Dang, {Viet D.} and Andrea Giovannucci and Jennings, {Nicholas R.}",
year = "2007",
month = "11",
day = "28",
language = "English (US)",
isbn = "1577353234",
volume = "2",
pages = "1184--1190",
booktitle = "AAAI-07/IAAI-07 Proceedings",

}

TY - GEN

T1 - Anytime optimal coalition structure generation

AU - Rahwan, Talal

AU - Ramchurn, Sarvapali D.

AU - Dang, Viet D.

AU - Giovannucci, Andrea

AU - Jennings, Nicholas R.

PY - 2007/11/28

Y1 - 2007/11/28

N2 - A key problem when forming effective coalitions of autonomous agents is determining the best groupings, or the optimal coalition structure, to select to achieve some goal. To this end, we present a novel, anytime algorithm for this task that is significantly faster than current solutions. Specifically, we empirically show that we are able to find solutions that are optimal in 0.082% of the time taken by the state of the art dynamic programming algorithm (for 27 agents), using much less memory (O(2n) instead of 0(3n) for n agents). Moreover, our algorithm is the first to be able to find solutions for more than 17 agents in reasonable time (less than 90 minutes for 27 agents, as opposed to around 2 months for the best previous solution).

AB - A key problem when forming effective coalitions of autonomous agents is determining the best groupings, or the optimal coalition structure, to select to achieve some goal. To this end, we present a novel, anytime algorithm for this task that is significantly faster than current solutions. Specifically, we empirically show that we are able to find solutions that are optimal in 0.082% of the time taken by the state of the art dynamic programming algorithm (for 27 agents), using much less memory (O(2n) instead of 0(3n) for n agents). Moreover, our algorithm is the first to be able to find solutions for more than 17 agents in reasonable time (less than 90 minutes for 27 agents, as opposed to around 2 months for the best previous solution).

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

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

M3 - Conference contribution

AN - SCOPUS:36348988449

SN - 1577353234

SN - 9781577353232

VL - 2

SP - 1184

EP - 1190

BT - AAAI-07/IAAI-07 Proceedings

ER -