Computational Complexity
An efficient implementation of a scaling minimum-cost flow algorithm
Journal of Algorithms
Methods for task allocation via agent coalition formation
Artificial Intelligence
A scalable, distributed algorithm for efficient task allocation
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
A Scalable Agent Location Mechanism
ATAL '99 6th International Workshop on Intelligent Agents VI, Agent Theories, Architectures, and Languages (ATAL),
Coalition formation with uncertain heterogeneous information
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Coalition Formation for Large-Scale Electronic Markets
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Brain Meets Brawn: Why Grid and Agents Need Each Other
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Agent-organized networks for dynamic team formation
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Modeling task allocation using a decision theoretic model
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Forming efficient agent groups for completing complex tasks
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Agent-based virtual organisations for the Grid
Multiagent and Grid Systems - Smart Grid Technologies & Market Models
MMAS'04 Proceedings of the First international conference on Massively Multi-Agent Systems
Filter Allocation Using Iterative ECNP
CIA '08 Proceedings of the 12th international workshop on Cooperative Information Agents XII
Formation of Service Value Networks for Decentralized Service Provisioning
ICSOC '08 Proceedings of the 6th International Conference on Service-Oriented Computing
Adaptive learning in evolving task allocation networks
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
Self-adaptation strategies to favor cooperation
KES-AMSTA'10 Proceedings of the 4th KES international conference on Agent and multi-agent systems: technologies and applications, Part I
The effects of local trust cooperation in multiagent systems
KES-AMSTA'10 Proceedings of the 4th KES international conference on Agent and multi-agent systems: technologies and applications, Part I
A dynamic trust network for autonomy-oriented partner finding
Journal of Intelligent Information Systems
International Journal of Intelligent Information and Database Systems
Multiagent task allocation in social networks
Autonomous Agents and Multi-Agent Systems
Improving self-organized resource allocation with effective communication
AP2PC'08 Proceedings of the 7th international conference on Agents and Peer-to-Peer Computing
A decision network based framework for multiagent coalition formation
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Synergy graphs for configuring robot team members
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Weighted synergy graphs for effective team formation with heterogeneous ad hoc agents
Artificial Intelligence
| Hi-index | 0.00 |
This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. We show that the complexity of this problem remains NP-hard. Moreover, it is not approximable within some factor. We develop an algorithm based on the contract-net protocol. Our algorithm is completely distributed, and it assumes that agents have only local knowledge about tasks and resources. We conduct a set of experiments to evaluate the performance and scalability of the proposed algorithm in terms of solution quality and computation time. Three different types of networks, namely small-world, random and scale-free networks, are used to represent various social relationships among agents in realistic applications. The results demonstrate that our algorithm works well and that it scales well to large-scale applications.