Reputation Criteria

This page is largely basically copied from the trustlet.org criteria page. Not yet convinced the criteria can be applied to any conceivable reputation system. Or there might be different ways to apply it. To be applied on these

(TODO define the context better)

Non self-depreciation (NSD)

vouching for others (by itself) never decreases a nodes' own reputation. Note: lets say you have an opinion and you know a friends opinion. Your own opinions weight may automatically decrease if you tell that of your friend. I.e. it is a sort-of self-depreciation. However, it may still in some cases be beneficial to you. Can be done after-the-fact.

Self-confidence(SC)

Edges to yourself dont matter. G and G' differ only in edges to A then for all b, f(G,A,b)=f(G',A,b) Can be done after-the-fact.

Skepticism(SKEP)

No edge from A to B in G; ¬(A→B) in G &Rarr, then f(G,A,B)<1

Monotonicity(M)

Vouching for others never decreases anyones reputation. This one isnt actually good, because it possibly conflicts that vouching should not be used to increase ones' own influence, which is;

Chains decrease/nonincrease(CD/CND)

If there is only one edge from A, and that edge goes to B, then for any node C, f(G,A,C) < f(G,A,B) if decreasing and f(G,A,C) ≤ f(G,A,B) for non-increasing.

Same connection, same result(SCSR)(composition)

If in both G and G' no paths from A to C other than via b∈B, and ∀b∈B f(G,b,C)=f(G',b,C) and f(G,A,b)=f(G',A,b) then f(G,A,C)=F(G',A,C)

Same connection, same result, 1 node(SCSR1)

If in both G and G' no paths from A to C other than via B and f(G,B,C)=f(G',B,C) and f(G,A,B)=f(G',A,b) then f(G,A,C)=F(G',A,C)

Unreachable ↠ no trust(U=>NT)

nonincreasing bottleneck with Omega = ... TODO