Stanford InfoLab Publication Server

A Sound and Complete Distributed Algorithm for Distributed Commerce Transactions

Ketchpel, Steven P. and Garcia-Molina, Hector (1996) A Sound and Complete Distributed Algorithm for Distributed Commerce Transactions. Technical Report. Stanford InfoLab. (Publication Note: Distributed Computing archive Volume 12 , Issue 1 (March 1999) table of contents Pages: 13 - 29 )




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.

Item Type:Techreport (Technical Report)
Additional Information:Previous number = SIDL-WP-1996-0040
Subjects:Computer Science > Digital Libraries
Projects:Digital Libraries
Related URLs:Project Homepage
ID Code:213
Deposited By:Import Account
Deposited On:28 Oct 2001 16:00
Last Modified:09 Dec 2008 08:39

Download statistics

Repository Staff Only: item control page