Abstract
Coalitional Resource Games (CRGs) are a natural and formal framework in which agents wish to form coalitions to pool their scarce resources in order to achieve a set of goals that satisfy all members of a coalition. Thus far, many computational questions surrounding CRGs have been studied, but to our knowledge, a number of natural decision problems in CRGs have not been solved. Therefore, in this paper we investigate the possibility of using binary particle swarm optimization (BPSO) as a stochastic search process to search for Maximal Successful Coalition (MAXSC) in CRGs, which is a DP-complete problem. For this purpose, we develop a one-dimensional binary encoding scheme, propose strategies for encoding repair to ensure that each encoding in every iteration process is approximately valid and logicallsy consistent, and discuss some key properties of repair strategies. To evaluate the effectiveness of our algorithms, we compare them with the only other algorithm available in the literature for identifying MAXSC (due to Shrot, Aumann, and Kraus). The result shows that our algorithms are significantly faster especially for large-scale datasets.




Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Notes
Note that the complexity of encoding repair for two-dimensional binary encoding is 𝓞(n 4) (see Zhang et al. [31]).
Note that the complexity of SAK is 𝓞(n 2), which is of exponential complexity (see Shrot et al. [24]).
Here, 6 has been tested to be the optimal solution in the same CRGs instance by SAK which is an exhaustive algorithm.
This is because coalitions which are bigger than C have been checked to be unsuccessful by SAK.
References
Airiau S (2013) Cooperative games and multiagent systems. Knowl Eng Rev 28(4):381–424
Al-Saqqar F, Bentahar J, Sultan K, El Menshawy M (2014) On the interaction between knowledge and social commitments in multi-agent systems. Appl Intell. doi:10.1007/s10489-013-0513-x
Abdallah S, Lesser V (2004) Organization-based cooperative coalition formation. In: Proceedings of the IEEE/WIC/ACM int. conf. on intell. agent tech., pp 162–168
Ye D, Zhang M, Sutanto D (2013) Self-adaptation-based dynamic coalition formation in a distributed agent network: a mechanism and a brief survey. IEEE Trans Parallel Distr Syst 24(5):1042–1051
Service TC, Adams JA (2011) Coalition formation for task allocation: theory and algorithms. Autonom Agents Multiagent Syst 22(2):225–248
Zhang GF, Jiang JG, Su ZP, Qi MB, Fang H (2010) Searching for overlapping coalitions in multiple virtual organizations. Inform Sci 180(17):3140–3156
Liu A, Li Q, Huang L, Ying S, Xiao M (2013) Coalitional game for community-based autonomous web services cooperation. IEEE Trans Serv Comput 6(3):387–399
Khosrowshahi Asl E, Bentahar J, Otrok H, Mizouni R (2013) Efficient coalition formation for web services. In: Proceedings of 10th IEEE int. conf. serv. comput., pp 737–744
Khosrowshahi Asl E, Bentahar J, Otrok H, Mizouni R (2014) Efficient community formation for web services. IEEE Trans Serv Comput. doi:10.1109/TSC.2014.2312940
Khan Z, Glisic S, DaSilva LA, Lehtomaki J (2011) Modeling the dynamics of coalition formation games for cooperative spectrum sharing in an interference channel. IEEE Trans Comput Intell Artif Intell Games 3(1):17–30
Menniti D, Costanzo F, Scordino N, Sorrentino N (2009) Purchase-bidding strategies of an energy coalition with demand-response capabilities. IEEE Trans Power Syst 24(3):1241–1255
Agarwal M, Kumar N, Vig L (2014) Non-additive multi-objective robot coalition formation. Expert Syst Appl 41(8):3736–3747
Hyunggon P, van der Schaar M (2009) Coalition-based resource negotiation for multimedia applications in informationally decentralized networks. IEEE Trans Multim 11(4):765–779
Saad W, Han Z, Basar T, Debbah M, Hjorungnes A (2011) Distributed coalition formation games for secure wireless transmission. Mobile Netw Appl 16(2):231–245
Service TC, Adams JA (2011) Constant factor approximation algorithms for coalition structure generation. Autonom Agents Multiagent Syst 23(1):1–17
Wooldridge M, Dunne PE (2006) On the computational complexity of coalitional resource games. Artif Intell 170(10):835–871
Dunne PE, Kraus S, Manisterski E, Wooldridge M (2010) Solving coalitional resource games. Artif Intell 174(1):20–50
Khan Z, Glisic S, DaSilva LA, Lehtomaki J (2011) Modeling the dynamics of coalition formation games for cooperative spectrum sharing in an interference channel. IEEE Trans Comput Intell Artif Intell Games 3(1):17–30
Guerrero J, Oliver G (2012) Multi-robot coalition formation in real-time scenarios. Robot Autonom Syst 60(10):1295–1307
Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In: Proceedings of IEEE int. conf. syst. man cybern., pp 4104–4108
Cechlárová K (2010) On max-min linear inequalities and coalitional resource games with sharable resources. Lin Algebra Appl 433(1):127–135
Alechina N, Logan B, Nga NH, Rakib A (2011) Logic for coalitions with bounded resources. J Logic Comput 21(6):907–937
Chitnis R, Hajiaghayi MT, Liaghat V (2011) Parameterized complexity of problems in coalitional resource games. In: Proceedings of 25th AAAI conf. artif. intell., pp 620–625
Shrot T, Aumann Y, Kraus S (2009) Easy and hard coalition resource game formation problems: a parameterized complexity analysis. In: Proceedings of 8th int. conf. autonom. agents multiagent syst., pp. 433–440
Service TC, Adams JA (2011) Randomized coalition structure generation. Artif Intell 175(16–17):2061–2074
Rahwan T, Michalak T, Wooldridge M, Jennings NR (2012) Anytime coalition structure generation in multi-agent systems with positive or negative externalities. Artif Intell 186:95–122
Sen S, Dutta PS (2000) Searching for optimal coalition structures. In: Proceedings of 4th int. conf. multiagent syst., pp 287–292
Yang JA, Luo ZH (2007) Coalition formation mechanism in multi-agent systems based on genetic algorithms. Appl Soft Comput 7(2):561–568
Xia N, Jiang JG, Hu YL (2004) Solution to agent coalition problem using improved ant colony optimization algorithm. In: Proceedings of IEEE/WIC/ACM int. conf. intell. agent tech., pp 475–478
Lin CF, Hu SL (2007) Multi-task overlapping coalition parallel formation algorithm. In: Proceedings of 6th int. joint conf. autonom. agents multiagent syst., pp 1260–1262
Zhang GF, Jiang JG, Lu CH, Su ZP, Fang H, Liu Y (2011) A revision algorithm for invalid encodings in concurrent formation of overlapping coalitions. Appl Soft Comput 11(2):2164–2172
Papadimitriou CH (1994) Computational complexity. Addision-Wesley, Reading
Shehory O, Kraus S (1998) Methods for task allocation via agent coalition formation. Artif Intell 101(1–2):165–200
Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of IEEE int. conf. neural network., pp 1942–1948
Luh GC, Lin CY, Lin YS (2011) A binary particle swarm optimization for continuum structural topology optimization. Appl Soft Comput 11(2):2833–2844
Cervantes A, Galvan I, Isasi P (2005) Binary particle swarm optimization in classification. Neural Netw World 15(3):229–241
Greenwood GW (2009) Using differential evolution for a subclass of graph theory problems. IEEE Trans Evol Comput 13(5):1190–1192
Qin A, Huang V, Suganthan P (2009) Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Trans Evol Comput 13(2):398–416
Acknowledgements
This work was supported in part by the National Natural Science Foundation of China under Grant 61174170, 61100127, 61371155 and the Science and Technology Key Projects of Anhui Province under Grant 1301b042023. In addition, the authors would like to thank the Editors and the anonymous referees for their comments and suggestions.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, G., Yang, R., Su, Z. et al. Using binary particle swarm optimization to search for maximal successful coalition. Appl Intell 42, 195–209 (2015). https://doi.org/10.1007/s10489-014-0589-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10489-014-0589-y