Social relation-based dynamic team organization by context-aware matchmaking

Team is a group of people who share the common object. However, in the dynamically changing situation, the existing members may be excluded, and new members may be included. This change is one of the most critical problems, which cause the failure of the team. In this paper, we propose a way of maintaining team in spite of the member’s modification. In order to achieve this object, we employ an abstract layer between team and member. This layer provides roles to the team by hiding the members. Therefore, a team can be free from the actual members, and members can be free from binding to a specific team. The roles binding, which connects member to the team, is provided in the proposed model according to the situation by matchmaking the best suitable member for a given role. By this, even the team’s members are changed, the role, which is required in the team, can be bound to other suitable member. In the matchmaking process, it is not sufficient to find a member, who has ability to perform the required role, because a team needs a fellowship among the members. For this, a social relation is used as criteria for calculating the suitability of role binding.

[1]  Michael Becht,et al.  ROPE: role oriented programming environment for multiagent systems , 1999, Proceedings Fourth IFCIS International Conference on Cooperative Information Systems. CoopIS 99 (Cat. No.PR00384).

[2]  Matthias Klusch,et al.  Dynamic service matchmaking among agents in open information environments , 1999, SGMD.

[3]  Ivar Jacobson,et al.  Object-oriented software engineering - a use case driven approach , 1993, TOOLS.

[4]  A. M. Madni,et al.  Recommender systems in e-commerce , 2014, 2014 World Automation Congress (WAC).

[5]  John Riedl,et al.  Combining Collaborative Filtering with Personal Agents for Better Recommendations , 1999, AAAI/IAAI.

[6]  James P. Lewis Team-Based Project Management , 1997 .

[7]  Gregory D. Abowd,et al.  Towards a Better Understanding of Context and Context-Awareness , 1999, HUC.

[8]  Edward H. Shortliffe,et al.  Rule Based Expert Systems: The Mycin Experiments of the Stanford Heuristic Programming Project (The Addison-Wesley series in artificial intelligence) , 1984 .

[9]  Hyacinth S. Nwana,et al.  Software agents: an overview , 1996, The Knowledge Engineering Review.

[10]  Evangelos Simoudis,et al.  Mining business databases , 1996, CACM.

[11]  Bruce G. Buchanan,et al.  The MYCIN Experiments of the Stanford Heuristic Programming Project , 1985 .

[12]  Bill N. Schilit,et al.  Context-aware computing applications , 1994, Workshop on Mobile Computing Systems and Applications.

[13]  Nicholas R. Jennings,et al.  The Gaia Methodology for Agent-Oriented Analysis and Design , 2000, Autonomous Agents and Multi-Agent Systems.

[14]  Nicholas R. Jennings,et al.  Intelligent agents: theory and practice , 1995, The Knowledge Engineering Review.

[15]  Roy H. Campbell,et al.  Olympus: A High-Level Programming Model for Pervasive Computing Environments , 2005, Third IEEE International Conference on Pervasive Computing and Communications.

[16]  Daniel Kuokka,et al.  Matchmaking for Information Agents , 1995, IJCAI.

[17]  Klara Nahrstedt,et al.  A Middleware Infrastructure for Active Spaces , 2002, IEEE Pervasive Comput..