Small worlds: the dynamics of networks between order and randomness
Small worlds: the dynamics of networks between order and randomness
Pheromone Modification Strategies for Ant Algorithms Applied to Dynamic TSP
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Modelling Coalition Formation over Time for Iterative Coalition Games
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Organization-Based Cooperative Coalition Formation
IAT '04 Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology
Trust evaluation through relationship analysis
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
An integrated trust and reputation model for open multi-agent systems
Autonomous Agents and Multi-Agent Systems
Statistical Comparisons of Classifiers over Multiple Data Sets
The Journal of Machine Learning Research
Local strategy learning in networked multi-agent team formation
Autonomous Agents and Multi-Agent Systems
SUNNY: a new algorithm for trust inference in social networks using probabilistic confidence models
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Memetic networks: analyzing the effects of network properties in multi-agent performance
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Ant colony optimization with hill climbing for the bandwidth minimization problem
Applied Soft Computing
An analytic modelling approach for network routing algorithms that use "ant-like" mobile agents
Computer Networks: The International Journal of Computer and Telecommunications Networking
Ant colony optimization for the cell assignment problem in PCS networks
Computers and Operations Research
Combining manual feedback with subsequent MDP reward signals for reinforcement learning
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
A probabilistic model for trust and reputation
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Optimal policy switching algorithms for reinforcement learning
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Quality of trust for social trust path selection in complex social networks
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Heterogeneous particle swarm optimization
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Improving the distributed constraint optimization using social network analysis
SBIA'10 Proceedings of the 20th Brazilian conference on Advances in artificial intelligence
Consensus in networked multi-agent systems with adversaries
Proceedings of the 14th international conference on Hybrid systems: computation and control
| Hi-index | 12.05 |
This paper discusses how social network theory can provide optimization algorithms with social heuristics. The foundations of this approach were used in the SAnt-Q (Social Ant-Q) algorithm, which combines theory from different fields to build social structures for state-space search, in terms of the ways that interactions between states occur and reinforcements are generated. Social measures are therefore used as a heuristic to guide exploration and approximation processes. Trial and error optimization techniques are based on reinforcements and are often used to improve behavior and coordination between individuals in a multi-agent system, although without guarantees of convergence in the short term. Experiments show that identifying different social behavior within the social structure that incorporates patterns of occurrence between states explored helps to improve ant coordination and optimization process within Ant-Q and SAnt-Q, giving better results that are statistically significant.