Optimal Trust Network Analysis with Subjective Logic

Trust network analysis with subjective logic (TNA-SL) simplifies complex trust graphs into series-parallel graphs by removing the most uncertain paths to obtain a canonical graph. This simplification could in theory cause loss of information and thereby lead to sub-optimal results. This paper describes a new method for trust network analysis which is considered optimal because it does not require trust graph simplification, but instead uses edge splitting to obtain a canonical graph. The new method is compared with TNA-SL, and our simulation shows that both methods produce equal results. This indicates that TNA-SL in fact also represents an optimal method for trust network analysis and that the trust graph simplification does not affect the result.

[1]  M. Degroot,et al.  Probability and Statistics , 2021, Examining an Operational Approach to Teaching Probability.

[2]  JøsangAudun,et al.  Simplification and analysis of transitive trust networks , 2006 .

[3]  Audun Jøsang.  Probabilistic Logic under Uncertainty , 2007, CATS.

[4]  Audun Jøsang,et al.  Simplification and analysis of transitive trust networks , 2006, Web Intell. Agent Syst..

[5]  Audun Jøsang,et al.  Conditional Deduction Under Uncertainty , 2005, ECSQARU.

[6]  Audun Jøsang,et al.  A Logic for Uncertain Probabilities , 2001, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[7]  Audun Jøsang,et al.  Combining Trust and Reputation Management for Web-Based Services , 2008, TrustBus.

[8]  Bruce Christianson,et al.  Why Isn't Trust Transitive? , 1996, Security Protocols Workshop.

[9]  Audun Jøsang,et al.  Exploring Different Types of Trust Propagation , 2006, iTrust.

[10]  Audun Jøsang,et al.  Trust network analysis with subjective logic , 2006, ACSC.