Optimized Graph-Based Trust Mechanisms using Hitting Times

Trust mechanisms can be computed by modeling a set of agents in a trust graph, a directed weighted graph in which agents are represented as vertices and relative trust as edges. Liu, Parkes, and Seuken [LPS16] present trust mechanisms that are robust against sybil attacks, including the proposed personalized hitting time (PHT) mechanism. In this paper, we propose a scalable algorithm for producing trust scores. In particular, we improve on the theoretical bound quoted by [LPS16] for computing PHT scores and other hitting time-based trust mechanisms.