A stable and efficient buyer coalition formation scheme for e-marketplaces
Proceedings of the fifth international conference on Autonomous agents
Extracting reputation in multi agent systems by means of social network topology
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Reputation and social network analysis in multi-agent systems
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Customer Coalitions in Electronic Markets
Agent-Mediated Electronic Commerce III, Current Issues in Agent-Based Electronic Commerce Systems (includes revised papers from AMEC 2000 Workshop)
Believing Others: Pros and Cons
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Searching for Optimal Coalition Structures
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Time-Variant Distributed Agent Matching Applications
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Coping with inaccurate reputation sources: experimental analysis of a probabilistic trust model
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Reputation in the venture games
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Methods for task allocation via agent coalition formation
Artificial Intelligence
| Hi-index | 0.00 |
In this paper we investigate the effect of mediated partnerships over agents' equilibrium strategies in two-sided economic search. A mediated partnershipis formed when an agent acts as a mediator, establishing a partnership between a pair of agents it encountered along its search, thereby reducing the other agents' amount of search. Surprisingly, this reduction in market friction induced by mediated partnerships does not always improve market efficiency. Use of mediated partnerships changes the equilibrium strategies used by agents in two-sided search models and introduces substantial computational complexity. This computational complexity is overcome with an innovative algorithm that facilitates equilibrium calculation.