A Time-dependent Group Matchmaking Mechanism for Creation of Agent-based Communities
نویسندگان
چکیده
In many agent-mediated electronic marketplaces, a facilitator is exploited to conduct matchmaking in finding agents with the same interests. During matchmaking, the consideration of newcomers and group matchmaking is crucial since favorable newcomers can bring preferable offers to the facilitator for generating better matches and hence maximizing the agents’ utility gains, furthermore, group matchmaking is urgently needed in everyday life for collaboration works. In Choi et al’s proposal, a solution for considering newcomers based on the Markov decision process is presented. However, it is not applicable for group matchmaking. In addition, the notion of individual utility tables and lifetime for each agent to meet the needs in real world has been neglected. Therefore in this paper, we propose the mechanism in the support of all of these requirements by extending Choi et al’s proposal. We also evaluate the facilitator to verify the effectiveness of this mechanism.
منابع مشابه
Identifying overlapping communities using multi-agent collective intelligence
The proposed algorithm in this research is based on the multi-agent particle swarm optimization as a collective intelligence due to the connection between several simple components which enables them to regulate their behavior and relationships with the rest of the group according to certain rules. As a result, self-organizing in collective activities can be seen. Community structure is crucial...
متن کاملAgent service matchmaking algorithm for autonomic element with semantic and QoS constraints
Agent service description and matchmaking problem for autonomic element has been taken as one of the most important issue in the field of autonomic computing based on agent and multi-agent system. Considering the semantic and QoS for capability description of agent service are two important issues during matchmaking, the factors of semantic and QoS during matchmaking are considered together, an...
متن کاملAutonomic Software Component QoS Matchmaking Algorithm Based on Fidelity Factor in Agent-Based Autonomic Computing System
Autonomic software component (ASC) QoS matchmaking problem for autonomic element has been taken as one of the most important issue in field of autonomic computing based on agent. Aimed at overcoming drawbacks such as subjectiveness and unfairness, and improving the self-configuration capability for autonomic element, we introduce evaluation mechanism of confidence of individual QoS attributes d...
متن کاملFlatulent Foodstuff, an Agent in the Creation of Infantile Colic: a Narrative Study based on the Traditional Iranian Medicine and Modern Investigation
Colic is a common and annoying problem in infancy whose etiology is not well understood. Traditional Iranian Medicine (TIM) scientists know flatulent food effective in creating this disorder. Since the reduction or withdrawal of this kind of food in mother’s and infant’s nutrition can be effective in preventing flatulence, this study aims to study and identify flatulent foods and the mechanism ...
متن کاملA model based, anatomy dependent method for ultra-fast creation of primary SPECT projections
Introduction: Monte Carlo (MC) is the most common method for simulating virtual SPECT projections. It is useful for optimizing procedures, evaluating correction algorithms and more recently image reconstruction as a forward projector in iterative algorithms; however, the main drawback of MC is its long run time. We introduced a model based method considering the eff...
متن کامل