Abstract:

The role assigning problems in agent organization are studied. All the stable assigning is  F made and a strong stable relation　≤ is constructed ≤ based on the preference of roles and agents, so 〈F,≤〉 is a partial order structure. Because any two elements in F have least upper bound and greatest lower bound, 〈F,≤〉 is a lattice. An algorithm finding  all the stable role assigning is devised, and a join operatorand meetoperator  are also  constructed. Because F,  can be constructed by our propose algorithm, the role assigning lattice 〈F, can be consequently constructed. Finally, the time complexity of the algorithm is analyzed and its application in agent coalition is investigated to verify its efficiency and feasibility.

Key words: role assigning; stable assigning set; strong stable r elation; partial order structure; role assigning lattice