Methods for task allocation via agent coalition formation
Artificial Intelligence
Reducing buyer search costs: implications for electronic marketplaces
Management Science - Special issue: Frontier research on information systems and economics
Coalition structure generation with worst case guarantees
Artificial Intelligence
A stable and efficient buyer coalition formation scheme for e-marketplaces
Proceedings of the fifth international conference on Autonomous agents
Larks: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace
Autonomous Agents and Multi-Agent Systems
Autonomous Agents and Multi-Agent Systems
Intelligent Agents on the Internet: Fact, Fiction, and Forecast
IEEE Expert: Intelligent Systems and Their Applications
Agent-Driven Online Business in Virtual Communities
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
On Agent-Mediated Electronic Commerce
IEEE Transactions on Knowledge and Data Engineering
Coalition Formation for Large-Scale Electronic Markets
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Agent-mediated electronic commerce: a survey
The Knowledge Engineering Review
Use of Markov chains to design an agent bidding strategy for continuous double auctions
Journal of Artificial Intelligence Research
Agents' strategies for the dual parallel search in partnership formation applications
AAMAS'04 Proceedings of the 6th AAMAS international conference on Agent-Mediated Electronic Commerce: theories for and Engineering of Distributed Mechanisms and Systems
Autonomous agents: Smart network installer and tester (SNIT)
Expert Systems with Applications: An International Journal
Proceedings of the 13th ACM Conference on Electronic Commerce
Physical search problems with probabilistic knowledge
Artificial Intelligence
| Hi-index | 0.00 |
In this paper we address the problem of agents engaged in a distributed costly two-sided search for pairwise partnerships in Multi-Agent Systems (MAS). While traditional two-sided search mechanisms are based on a purely sequential search of all searchers, our mechanism integrates an ability of some of the agents to maintain several search efforts in parallel at each search stage. We show that in many environments the transition to the new mechanism is inevitable since the adoption of the parallel-interactions based search suggests a greater utility for the searching agents. By exploring the appropriate model equations, we present the new dynamics that drive the equilibrium when using such a mechanism in MAS environments. Complementary algorithms are offered, based on the unique equilibria characteristics found, for facilitating the extraction of the agents' strategies. The analysis methodology used supplies a comprehensive solution to a self contained model, and also offers a great value for future work concerning distributed two-sided mechanisms for MAS. Towards the end of the paper we review two of these important models that can benefit from the proposed analysis.