{"title":"一种可靠的多智能体联盟形成算法","authors":"S. Aknine","doi":"10.1109/ISIC.1999.796670","DOIUrl":null,"url":null,"abstract":"Efficiency is a major concern for all problem solving systems. One way of achieving efficiency in multi-agent systems is the application of cooperation techniques to speed up problem solving. Coalition formation can improve the performances of a multi-agent system by solving problems collectively. Given the different work done on coalition formation, unfortunately, many approaches present several gaps in the definition of the agent behavioral algorithms for coalition formation. The research presented in the article outlines the problems found in these approaches and offers a solution to this problem by using preference models.","PeriodicalId":300130,"journal":{"name":"Proceedings of the 1999 IEEE International Symposium on Intelligent Control Intelligent Systems and Semiotics (Cat. No.99CH37014)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A reliable algorithm for multi-agent coalition formation\",\"authors\":\"S. Aknine\",\"doi\":\"10.1109/ISIC.1999.796670\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Efficiency is a major concern for all problem solving systems. One way of achieving efficiency in multi-agent systems is the application of cooperation techniques to speed up problem solving. Coalition formation can improve the performances of a multi-agent system by solving problems collectively. Given the different work done on coalition formation, unfortunately, many approaches present several gaps in the definition of the agent behavioral algorithms for coalition formation. The research presented in the article outlines the problems found in these approaches and offers a solution to this problem by using preference models.\",\"PeriodicalId\":300130,\"journal\":{\"name\":\"Proceedings of the 1999 IEEE International Symposium on Intelligent Control Intelligent Systems and Semiotics (Cat. No.99CH37014)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 1999 IEEE International Symposium on Intelligent Control Intelligent Systems and Semiotics (Cat. No.99CH37014)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIC.1999.796670\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 1999 IEEE International Symposium on Intelligent Control Intelligent Systems and Semiotics (Cat. No.99CH37014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIC.1999.796670","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A reliable algorithm for multi-agent coalition formation
Efficiency is a major concern for all problem solving systems. One way of achieving efficiency in multi-agent systems is the application of cooperation techniques to speed up problem solving. Coalition formation can improve the performances of a multi-agent system by solving problems collectively. Given the different work done on coalition formation, unfortunately, many approaches present several gaps in the definition of the agent behavioral algorithms for coalition formation. The research presented in the article outlines the problems found in these approaches and offers a solution to this problem by using preference models.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
