Research on the transitivity closure of trust network

Trust plays an important role in the fields of Distributed Artificial Intelligence (DAI) and Multi-agent Systems (MAS), which provides a more effective way to reduce complexity in condition of increasing social complexity. A number of computational issues about trust have been studied. However, the properties of trust and the transitivity closure of trust network are failed to be considered by researchers. In this paper, we will rectify this omission. Particularly, the binary value and some properties of trust is discussed in this paper. In addition, an algorithm of constructing transitivity of trust network is proposed with low computational complexity.