Stanford InfoLab Publication Server

A Sound and Complete Algorithm for Distributed Commerce Transactions

Ketchpel, Steven P. and Garcia-Molina, Hector (2000) A Sound and Complete Algorithm for Distributed Commerce Transactions. Distributed Computing, vol.12, no.1, p. 13-29, 0178-2770 Springer-Verlag 1999 .




In a multi-party transaction such as fulfilling an information request from multiple sources (also called a distributed commerce transaction), agents face risks from dealing with untrusted agents. These risks are compounded in the face of deadlines, e.g., an agent may fail to deliver purchased goods by the time the goods are needed. We present a distributed algortihm that mitigates these risks, by generating a safe sequence of actions (when possible) that completes a commerce transaction with no risk. We show that the algorithm is sound (produces only safe multi-agent action sequences) and complete (finds a safe sequence whenever one exists). We also show how the algorithm may be extended so that agents may interact directly with other participants rather than through a trusted intermediary.

Item Type:Article
Additional Information:Previous number = SIDL-WP-1997-0074
Subjects:Computer Science > Digital Libraries
Projects:Digital Libraries
Related URLs:Project Homepage
ID Code:465
Deposited By:Import Account
Deposited On:29 Oct 2001 16:00
Last Modified:07 Oct 2008 12:15

Download statistics

Repository Staff Only: item control page