Generation algorithm for the role assigning lattice
Wei Zhang · Journal of Shandong University · 2009
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 operator ■ and meet operator are also constructed.Because F,■ and 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.