Two measures I added to the engine
- The switching point per criterion. For each criterion, the engine computes the exact weight at which the winner would stop winning. If that point sits very close to the weight you assigned, the conclusion depends on a choice of yours that could easily have gone the other way — and that has to be reported, not hidden.
- Global robustness. Perturbing one weight at a time is not enough, because in practice every weight is arguable at once. So the engine samples a Dirichlet distribution centred on the declared weights and solves the full matrix 10,000 times, counting what fraction of scenarios each option wins.