×

A generation algorithm for the role assigning lattice. (Chinese. English summary) Zbl 1212.68081

Summary: Role assigning problems in agent organization are studied. All the stable assigning are made to \(F\) and a strong stable relation \(\leqslant\) is constructed based on the preference of roles and agents, so \(\langle F, \leqslant \rangle\) is a partial order structure. Because any two elements in \(F\) have a least upper bound and a greatest lower bound, \(\langle F, \leqslant \rangle\) is a lattice. An algorithm finding all the stable role assigning is devised, and a join operator \(\oplus\) and a meet operator \(\otimes\) are also constructed. Because \(F,\;\oplus\) and \(\otimes\) can be constructed by the proposed algorithm, the role assigning lattice \(\langle F, \oplus, \otimes \rangle\) 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.

MSC:

68Q25 Analysis of algorithms and problem complexity
06D99 Distributive lattices
68W05 Nonnumerical algorithms
PDFBibTeX XMLCite