Results 1 
4 of
4
A comparison of distributed constraint satisfaction approaches with respect to privacy
 In DCR
, 2002
"... There is an increasing interest in distributed and asynchronous search algorithms for solving distributed constraint satisfaction problems (DisCSP). An important motivation for distributed problem solving is the agents ’ ability to keep their constraints private. Cryptographic techniques [GB96] offe ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
(Show Context)
There is an increasing interest in distributed and asynchronous search algorithms for solving distributed constraint satisfaction problems (DisCSP). An important motivation for distributed problem solving is the agents ’ ability to keep their constraints private. Cryptographic techniques [GB96] offer a certain protection from several types of attacks. However, when an attack succeeds, no agent can know how much privacy he has lost. We assume that agents enforce their privacy by dropping out of the search process whenever the estimated value of the information that they need to reveal in the future exceeds that attached to a successful solution of the DisCSP. We compare several distributed search algorithms as to how likely they are to terminate prematurely for privacy reasons, and arrange the algorithms in a hierarchy that reflects this relation. 1.
Privacy for DisCSPbased Modeling in MultiAgent Planning
"... Constraint Satisfaction and SAT can model planning problems (Kautz & Selman 1996) and this approach is quite successful. There is an increasing interest in distributed and asynchronous search algorithms for solving distributed constraint satisfaction problems (DisCSP). An important motivation fo ..."
Abstract
 Add to MetaCart
(Show Context)
Constraint Satisfaction and SAT can model planning problems (Kautz & Selman 1996) and this approach is quite successful. There is an increasing interest in distributed and asynchronous search algorithms for solving distributed constraint satisfaction problems (DisCSP). An important motivation for distributed problem solving is the agents ’ ability to keep their constraints private. Cryptographic techniques (Goldwasser & Bellare 1996) offer a certain protection from several types of attacks. However, when an attack succeeds, no agent can know how much privacy he has lost. We assume that agents enforce their privacy by dropping out of the search process whenever the estimated value of the information that they need to reveal in the future exceeds that attached to a successful solution of the DisCSP. We compare several distributed search algorithms as to how likely they are to terminate prematurely for privacy reasons, and arrange the algorithms in a hierarchy that reflects this relation.
Openness in Asynchronous Constraint Satisfaction Algorithms
"... Constraint satisfaction occurs in many practical applications. Recently, there has been increasing interest in distributed constraint satisfaction (DisCSP), where variables and constraints are distributed among several agents, and algorithms for finding solutions through asynchronous exchange of mes ..."
Abstract
 Add to MetaCart
(Show Context)
Constraint satisfaction occurs in many practical applications. Recently, there has been increasing interest in distributed constraint satisfaction (DisCSP), where variables and constraints are distributed among several agents, and algorithms for finding solutions through asynchronous exchange of messages among agents. An important reason for distributed problem solving is openness: allowing the problem to define itself dynamically through the combination of agents that participate in it. We investigate openness in complete asynchronous search algorithms for DisCSP, in particular the problem of agents joining and leaving a search process in progress without destroying consistency for the other agents, and give complete search algorithms that satisfy this property. 1