{"id":"https://openalex.org/W90370469","doi":null,"title":"An Improved Dynamic Programming Algorithm for Coalition Structure Generation (Short Paper)","display_name":"An Improved Dynamic Programming Algorithm for Coalition Structure Generation (Short Paper)","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W90370469","mag":"90370469"},"language":"en","primary_location":{"id":"mag:90370469","doi":null,"is_oa":false,"landing_page_url":"https://www.ifaamas.org/Proceedings/aamas08/proceedings/pdf/paper/AAMAS08_0192.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007282319","display_name":"Talal Rahwan","orcid":"https://orcid.org/0000-0003-0070-0667","observed_orcids":["https://orcid.org/0000-0003-0070-0667"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Talal Rahwan","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-0070-0667","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5036583884","display_name":"Nicholas R. Jennings","orcid":"https://orcid.org/0000-0003-0166-248X","observed_orcids":["https://orcid.org/0000-0003-0166-248X"]},"institutions":[{"id":"https://openalex.org/I43439940","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543","country_code":"GB","type":"education","lineage":["https://openalex.org/I43439940"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Nicholas R. Jennings","raw_affiliation_strings":["University of Southampton"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Southampton","institution_ids":["https://openalex.org/I43439940"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9789999723434448,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9789999723434448,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.019300000742077827,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0005000000237487257,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/coalition-structure-generation","display_name":"coalition structure generation","score":0.9959999918937683},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.7099999785423279},{"id":"https://openalex.org/keywords/multi-agent-systems","display_name":"multi-agent systems","score":0.8510000109672546},{"id":"https://openalex.org/keywords/coalition-formation","display_name":"coalition formation","score":0.8650000095367432},{"id":"https://openalex.org/keywords/social-welfare-maximization","display_name":"social welfare maximization","score":0.9620000123977661},{"id":"https://openalex.org/keywords/memory-reduction","display_name":"memory reduction","score":0.5289999842643738},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.515999972820282}],"concepts":[{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.7246041297912598},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.640925407409668},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6125109195709229},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5264468789100647},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5215815901756287},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44148722290992737},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.43261927366256714},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22803041338920593},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.11955863237380981},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:90370469","doi":null,"is_oa":false,"landing_page_url":"https://www.ifaamas.org/Proceedings/aamas08/proceedings/pdf/paper/AAMAS08_0192.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1788505167","https://openalex.org/W1971441460","https://openalex.org/W2015062753","https://openalex.org/W2097916157","https://openalex.org/W2139662247","https://openalex.org/W2156887976","https://openalex.org/W2163675995","https://openalex.org/W7124162256"],"related_works":["https://openalex.org/W7124170842","https://openalex.org/W3005699525","https://openalex.org/W7096934994","https://openalex.org/W6980579131","https://openalex.org/W1645067740","https://openalex.org/W2121451649","https://openalex.org/W2137809244","https://openalex.org/W2518132864","https://openalex.org/W6999343724","https://openalex.org/W144107075"],"abstract_inverted_index":{"Forming":[0],"effective":[1],"coalitions":[2,31],"is":[3,18,37,44,85,104,125,142],"a":[4,108],"major":[5],"research":[6],"challenge":[7],"in":[8,81,151,157],"the":[9,19,23,34,49,72,86,99,136,149,152,158],"field":[10],"of":[11,21,25,52,98,102,111,135,148],"multi-agent":[12],"systems.":[13],"Central":[14],"to":[15,48,56,92,127,144],"this":[16,114],"endeavour":[17],"problem":[20,43],"partitioning":[22],"set":[24],"agents":[26],"into":[27],"exhaustive":[28],"and":[29,141,155],"disjoint":[30],"such":[32],"that":[33,54,75,105,124],"social":[35],"welfare":[36],"maximized.":[38],"This":[39],"coalition":[40],"structure":[41],"generation":[42],"extremely":[45],"challenging":[46],"due":[47,91],"exponential":[50],"number":[51],"partitions":[53],"need":[55],"be":[57],"examined.":[58],"Specifically,":[59],"given":[60,138],"n":[61,66,83],"agents,":[62],"there":[63],"are":[64],"O(n":[65],")":[67,84],"possible":[68],"partitions.":[69],"To":[70],"date,":[71],"only":[73,146],"algorithm":[74,122],"can":[76],"find":[77],"an":[78,118],"optimal":[79],"solution":[80],"O(3":[82],"Dynamic":[87,120],"Programming":[88,121],"(DP)":[89],"algorithm,":[90],"Rothkopf":[93],"et":[94],"al.":[95],"However,":[96],"one":[97],"main":[100],"limitations":[101],"DP":[103,132],"it":[106],"requires":[107],"significant":[109],"amount":[110],"memory.":[112],"In":[113],"paper,":[115],"we":[116],"devise":[117],"Improved":[119],"(IDP)":[123],"proved":[126],"perform":[128],"fewer":[129],"operations":[130,137],"than":[131],"(e.g.":[133],"38.7%":[134],"25":[139],"agents),":[140],"shown":[143],"use":[145],"33.3%":[147],"memory":[150],"best":[153],"case,":[154],"66.6%":[156],"worst.":[159]},"counts_by_year":[],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2016-06-24T00:00:00"}