I wasn't able to find either an optimal or low-error-approximate solution to this problem. My current algorithm is sub-optimal in general and could produce results uncomfortably far from the optimal solution, but the current data doesn't actually present a scenario where it matters: my current algorithm is optimal with the current data. Long-term, if I can't find an algorithm that I'm happy with, I could make the trust lists ordered as some have suggested.