[DESIGN] Deterministic dispute resolution — what is the fairest algorithm?

[omoshola-o]

ACP declares that disputes between agents resolve
deterministically — no support tickets, no humans
in the loop by default.

But the spec does not yet define the algorithm.

The inputs available at dispute time:

• The declared condition and whether it was met
• The execution result submitted by the payee
• Both agents' reputation scores
• The SLA declarations from the NegotiationContract
• The failure_handling rules declared at settlement creation

What is the fairest deterministic resolution algorithm
given these inputs?

This requires thinking from people who understand
mechanism design, game theory, or agent economics.