Distributed constraint satisfaction with partially known constraints

  • Authors:

  • Ismel Brito;Amnon Meisels;Pedro Meseguer;Roie Zivan

  • Affiliations:

  • IIIA, Ins. Inv. Intel.ligència Artificial, CSIC, Bellaterra, Spain 08193;Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel 84-105;IIIA, Ins. Inv. Intel.ligència Artificial, CSIC, Bellaterra, Spain 08193;Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel 84-105

  • Venue:
  • Constraints
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Distributed constraint satisfaction problems (DisCSPs) are composed of agents connected by constraints. The standard model for DisCSP search algorithms uses messages containing assignments of agents. It assumes that constraints are checked by one of the two agents involved in a binary constraint, hence the constraint is fully known to both agents. This paper presents a new DisCSP model in which constraints are kept private and are only partially known to agents. In addition, value assignments can also be kept private to agents and not be circulated in messages. Two versions of a new asynchronous backtracking algorithm that work with partially known constraints (PKC) are presented. One is a two-phase asynchronous backtracking algorithm and the other uses only a single phase. Another new algorithm preserves the privacy of assignments by performing distributed forward-checking (DisFC). We propose to use entropy as quantitative measure for privacy. An extensive experimental evaluation demonstrates a trade-off between preserving privacy and the efficiency of search, among the different algorithms.