Coalition Structure Generation in Multi-Agent Systems with Positive and Negative Externalities

Coalition structure generation has received considerable attention in recent research. Several algorithms have been proposed to solve this problem in Characteristic Function Games (CFGs), where every coalition is assumed to perform equally well in any coalition structure containing it. In contrast, very little attention has been given to the more general Partition Function Games (PFGs), where a coalition's effectiveness may change from one coalition structure to another. In this paper, we deal with PFGs with positive and negative externalities. In this context, we identify the minimum search that is required in order to establish a bound on the quality of the best coalition structure found. We then develop an anytime algorithm that improves this bound with further search, and show that it out-performs the existing state-of-the-art algorithms by orders of magnitude.

[1]  Huajun Chen,et al.  The Semantic Web , 2011, Lecture Notes in Computer Science.

[2]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[3]  Tomasz P. Michalak,et al.  Optimal Coalition Structure Generation In Partition Function Games , 2008, ECAI.

[4]  Carsten Lutz,et al.  Description Logics with Concrete Domains-A Survey , 2002, Advances in Modal Logic.

[5]  Emil L. Post.  A variant of a recursively unsolvable problem , 1946 .

[6]  Ian Horrocks,et al.  Using an Expressive Description Logic: FaCT or Fiction? , 1998, KR.

[7]  A. Wilkie.  THE CLASSICAL DECISION PROBLEM (Perspectives in Mathematical Logic) By Egon Börger, Erich Grädel and Yuri Gurevich: 482 pp., DM.158.–, ISBN 3 540 57073 X (Springer, 1997). , 1998 .

[8]  Ian Horrocks,et al.  Ontology Reasoning in the SHOQ(D) Description Logic , 2001, IJCAI.

[9]  Peter F. Patel-Schneider,et al.  A Semantics and Complete Algorithm for Subsumption in the CLASSIC Description Logic , 1993, J. Artif. Intell. Res..

[10]  Ian Horrocks,et al.  Description Logics for the Semantic Web , 2002, Künstliche Intell..

[11]  Ian Horrocks,et al.  Reasoning in the SHOQ(Dn) Description Logic , 2002, Description Logics.

[12]  Franz Baader,et al.  Qualifying Number Restrictions in Concept Languages , 1991, KR.

[13]  Ian Horrocks,et al.  Practical Reasoning for Very Expressive Description Logics , 2000, Log. J. IGPL.

[14]  Franz Baader,et al.  Extensions of Concept Languages for a Mechanical Engineering Application , 1992, GWAI.

[15]  Onn Shehory,et al.  Coalition structure generation with worst case guarantees , 2022 .

[16]  Ian Horrocks.  Reasoning with Expressive Description Logics: Theory and Practice , 2002, CADE.

[17]  Nicholas R. Jennings,et al.  Generating coalition structures with finite bound from the optimal guarantees , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[18]  Franz Baader,et al.  Tableau Algorithms for Description Logics , 2000, TABLEAUX.

[19]  Maarten Marx,et al.  A Road-Map on Complexity for Hybrid Logics , 1999, CSL.

[20]  Ian Horrocks,et al.  Reasoning in the SHOQ(D n ) Description Logic. , 2002 .

[21]  James A. Hendler,et al.  Web ontology language (OWL) reference version 1 , 2002 .

[22]  Volker Haarslev,et al.  Foundations of Spatioterminological Reasoning with Description Logics , 1998, KR.

[23]  Franz Baader,et al.  Fusions of Description Logics and Abstract Description Systems , 2011, J. Artif. Intell. Res..

[24]  Sarit Kraus,et al.  Methods for Task Allocation via Agent Coalition Formation , 1998, Artif. Intell..

[25]  C. Lutz.  The Complexity of Reasoning with Concrete Domains , 1999 .

[26]  Volker Haarslev,et al.  RACER System Description , 2001, IJCAR.

[27]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[28]  Sarvapali D. Ramchurn,et al.  An Anytime Algorithm for Optimal Coalition Structure Generation , 2014, J. Artif. Intell. Res..

[29]  W. Riha,et al.  Algorithm 29 efficient algorithms for doubly and multiply restricted partitions , 1976, Computing.

[30]  Franz Baader,et al.  A Scheme for Integrating Concrete Domains into Concept Languages , 1991, IJCAI.

[31]  Diego Calvanese,et al.  Dwq : Esprit Long Term Research Project, No 22469 on the Decidability of Query Containment under Constraints on the Decidability of Query Containment under Constraints , 2022 .

[32]  Ian Horrocks,et al.  Keys, Nominals, and Concrete Domains , 2003, IJCAI.

[33]  Diego Calvanese,et al.  Keys for Free in Description Logics , 2000, Description Logics.

[34]  Klaus Schild,et al.  A Correspondence Theory for Terminological Logics: Preliminary Report , 1991, IJCAI.

[35]  David Toman,et al.  On Decidability and Complexity of Description Logics with Uniqueness Constraints , 2001, Description Logics.

[36]  Alexander Borgida,et al.  Adding Uniqueness Constraints to Description Logics (Preliminary Report) , 1997, DOOD.

[37]  G. Kamp,et al.  CTL : a description logic with expressive concrete domains , 1996 .

[38]  Carsten Lutz,et al.  Reasoning about Entity Relationship Diagrams with Complex Attribute Dependencies , 2002, Description Logics.

[39]  Joseph Y. Halpern,et al.  A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief , 1992, Artif. Intell..

[40]  David Toman,et al.  On reasoning about structural equality in XML: a description logic approach , 2003, Theor. Comput. Sci..

[41]  Gert Smolka,et al.  Attributive Concept Descriptions with Complements , 1991, Artif. Intell..

[42]  Robert L. Berger.  The undecidability of the domino problem , 1966 .

[43]  Volker Haarslev,et al.  The Description Logic ALCNHR+ Extended with Concrete Domains: A Practically Motivated Approach , 2000, IJCAR.

[44]  Franz Baader,et al.  Description Logics with Concrete Domains and Aggregation , 1998, ECAI.

[45]  Diego Calvanese,et al.  Description Logics for Conceptual Data Modeling , 1998, Logics for Databases and Information Systems.

[46]  Carsten Lutz,et al.  PSpace Reasoning with the Description Logic ALCF(D) , 2002, Logic Journal of the IGPL.

[47]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[48]  Carsten Lutz.  NEXPTIME-Complete Description Logics with Concrete Domains , 2001, IJCAR.

[49]  Ian Horrocks,et al.  Practical Reasoning for Expressive Description Logics , 1999, LPAR.

[50]  Nicholas R. Jennings,et al.  Coalition Structure Generation : Dynamic Programming Meets Anytime Optimization , 2008 .

[51]  Volker Haarslev,et al.  Practical Reasoning in RACER with a Concrete Domain for Linear Inequations , 2002, Description Logics.

[52]  Ian Horrocks,et al.  OIL: An Ontology Infrastructure for the Semantic Web , 2001, IEEE Intell. Syst..

[53]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[54]  Frank van Harmelen,et al.  Reviewing the design of DAML+OIL: an ontology language for the semantic web , 2002, AAAI/IAAI.

[55]  Longfei Jin,et al.  Description Logic을 이용한 전자카타로그 온톨로지 모델링 , 2005 .