HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Physics >
PHYS Conference Papers >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/2895
Title: Efficient search of winning strategies in multi-agent systems on random network : importance of local solidarity
Authors: Pang, Tin Yau
Szeto, Kwok-Yip
Keywords: Multi-agent systems
Strategies
Network
Issue Date: Sep-2006
Citation: Proceedings of the 7th International Conference on Intelligent Data Engineering and Automated Learning, (Sept. 20-23, 2006, Burgos, Spain), p. 1191-1198
Abstract: Multi-agent systems defined on a network can be used for modelling the competition between companies in terms of market dominance. In view of the enormous size of the search space for winning strategies of initial configuration of resource allocation on network, we focus our search on the subspace defined by special local clustering effects, using the recently developed evolutionary computational algorithm. Strategies that emphasize local solidarity, measured by the formation of clusters in the form of triangles linkage between members of the same company, prove to be effective in winning both the market share with high probability and high speed. The result provides a good guideline to improve the collective competitiveness in a network of agents. The formulation is based on the Ising model in statistical physics and the evolutionary game is based on Monte Carlo simulation. Significance and the application of the algorithm in the context of econophysics and damage spreading in network are discussed.
Rights: The original publication is available at http://www.springerlink.com/
URI: http://hdl.handle.net/1783.1/2895
Appears in Collections:PHYS Conference Papers

Files in This Item:

File Description SizeFormat
EfficientsearchofwinningstrategiesinMASonRandomnetworkPangSzetoIdeal06.pdf304KbAdobe PDFView/Open

All items in this Repository are protected by copyright, with all rights reserved.