I thought that I had a good idea for limiting each individual truster when handling the last two criteria: set it up as a circulation problem as below, and then find the maximum flow. The "user tX"s through whom flow passes would be the DT1s selected.
(The orders of the users would be randomized on each run.)
There are efficient algorithms for maximizing the flow in problems similar to this, which is why thinking about it in this way occurred to me. However, it turns out that the "exactly 0 or exactly 10" requirement on the rightmost edges makes finding an exact solution too difficult.
Dude, just do what you want and leave us out with your maths spinning Harry Potter skills. We aren't in a maths class here. Besides, if you are going to use the Merit gained as criterion for determining the DT, then it is flawed from the beginning. Isn't merit most times abused here?(The orders of the users would be randomized on each run.)
There are efficient algorithms for maximizing the flow in problems similar to this, which is why thinking about it in this way occurred to me. However, it turns out that the "exactly 0 or exactly 10" requirement on the rightmost edges makes finding an exact solution too difficult.
BTW, so Lauda is suddenly awaken from her slumber?