Abstract: In directed graphs, the relationship between users is asymmetric, resulting in two types of triangles: cycle triangles and flow triangles. This paper studies the problem of ...
Abstract: We investigate the problem of learning the trustworthiness of agents in a directed graph, where agents receive stochastic trust information about their in-neighbors. We consider a setting ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback