A formal treatment of distributed matchmaking (poster)
AGENTS '98 Proceedings of the second international conference on Autonomous agents
Community-based service location
Communications of the ACM
Matchmaking among minimal agents without a facilitator
Proceedings of the fifth international conference on Autonomous agents
Robustness of reputation-based trust: boolean case
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
A peer-to-peer approach to resource location in Grid environments
Grid resource management
Effect of referrals on convergence to satisficing distributions
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Effect of joining decisions on peer clusters
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Agent-organized networks for multi-agent production and exchange
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Engineering self-organizing referral networks for trustworthy service selection
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
| Hi-index | 0.00 |
Research on social networks have received increasing attention in multiagent systems due to the popularity of peer-to-peer networks, social networking sites, electronic supply chains, etc. The commonunderlying research issue in these domains is the search and location of desirable interaction or collaboration partners in are latively large population. This paper is motivated by some recent, intriguing research results involving agent-organized networks (AONs). In AONs agents have a limited number of collaboration partners at any time, represented by edges in a network of agent nodes, and can rewire edges, i.e., change partners, to improve performance. It was found that random selection of partners at every time period produced better performance but incurred larger search costs in a production and exchange economy compared to gradual rewiring of edges in the network. We propose an exponentially decaying exploration scheme that produces similar utilities to random rewiring but with much less rewiring costs. We also experiment with more realistic problem domains involving manufacturing profits, inventory costs, and stockpiling limits and observe superior utilities with our proposed searching scheme for collaborators.