A Sound and Complete Distributed Algorithm for Distributed Commerce Transactions

Abstract

In situations where self-interested agents are interacting in an environment of distrust, commercial exchanges may be blocked due to a lack of trust. We propose a fully distributed algorithm that each agent may run to provide minimum guarantees about the outcomes of such exchanges. The algorithm is shown in operation on two examples, one feasible and one not, and is proven to be sound and complete. The algorithm is extended to consider situations in which direct trust does exist between certain participants and those with deadlines for completion. Examples and proofs of soundness and completeness are given for these extensions as well.