Integrating domain and constraint privacy reasoning in the distributed stochastic algorithm with breakouts

Privacy has traditionally been a major motivation of distributed problem solving. One popular approach to enable privacy in distributed environments is to implement complex cryptographic protocols. In this paper, we propose a different, orthogonal approach, which is to control the quality and the quantity of publicized data. We consider the Open Constraint Programming model and focus on algorithms that solve Distributed Constraint Optimization Problems (DCOPs) using a local search approach. Two such popular algorithms exist to find good solutions to DCOP: DSA and GDBA. In this paper, we propose DSAB, a new algorithm that merges ideas from both algorithms to allow extensive handling of constraint privacy. We also study how algorithms behave when solving Utilitarian DCOPs, where utilitarian agents want to reach an agreement while reducing the privacy loss. We experimentally study how the utilitarian approach impacts the quality of the solution and of publicized data.

[1]  Nabil R. Adam,et al.  Security-control methods for statistical databases: a comparative study , 1989, ACM Comput. Surv..

[2]  Jin-Kao Hao,et al.  A General Approach for Constraint Solving by Local Search , 2004, J. Math. Model. Algorithms.

[3]  Steven Okamoto,et al.  Explorative anytime local search for distributed constraint optimization , 2014, Artif. Intell..

[4]  Makoto Yokoo,et al.  Utilitarian Approach to Privacy in Distributed Constraint Optimization Problems , 2017, FLAIRS Conference.

[5]  Tamir Tassa,et al.  P-SyncBB: A Privacy Preserving Branch and Bound DCOP Algorithm , 2016, J. Artif. Intell. Res..

[6]  M. Yokoo,et al.  Distributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems , 1996 .

[7]  Makoto Yokoo,et al.  The distributed breakout algorithms , 2005, Artif. Intell..

[8]  Tamir Tassa,et al.  Privacy Preserving Implementation of the Max-Sum Algorithm and its Variants , 2017, J. Artif. Intell. Res..

[9]  Abraham Bernstein,et al.  Improving Approximate Algorithms for DCOPs Using Ranks , 2016 .

[10]  Latanya Sweeney,et al.  k-Anonymity: A Model for Protecting Privacy , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[11]  Steven Okamoto,et al.  Distributed Breakout: Beyond Satisfaction , 2016, IJCAI.

[12]  Paul Morris,et al.  The Breakout Method for Escaping from Local Minima , 1993, AAAI.

[13]  Barry O'Sullivan,et al.  Soft Constraints of Difference and Equality , 2011, J. Artif. Intell. Res..

[14]  Carl Hewitt,et al.  A Universal Modular ACTOR Formalism for Artificial Intelligence , 1973, IJCAI.

[15]  Milind Tambe,et al.  Analysis of Privacy Loss in Distributed Constraint Optimization , 2006, AAAI.

[16]  Amnon Meisels,et al.  Distributed constraint satisfaction with partially known constraints , 2009, Constraints.

[17]  Milind Tambe,et al.  Distributed Algorithms for DCOP: A Graphical-Game-Based Approach , 2004, PDCS.

[18]  Olivier Boissier,et al.  Privacy Preservation in a Decentralized Calendar System , 2009, PAAMS.

[19]  Boi Faltings,et al.  Protecting Privacy through Distributed Computation in Multi-agent Decision Making , 2013, J. Artif. Intell. Res..

[20]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[21]  Boi Faltings,et al.  A Scalable Method for Multiagent Constraint Optimization , 2005, IJCAI.

[22]  Makoto Yokoo,et al.  Distributed Private Constraint Optimization , 2008, 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology.

[23]  Christian Bessiere,et al.  Backtracking in Distributed Constraint Networks , 1998 .

[24]  Eugene C. Freuder,et al.  Anytime algorithms for constraint satisfaction and SAT problems , 1996, SGAR.

[25]  Boi Faltings,et al.  Privacy Guarantees through Distributed Constraint Satisfaction , 2008, 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology.

[26]  Sylvain Piechowiak,et al.  Privacy for the Distributed Stochastic Algorithm with Breakouts , 2020, ISAIM.

[27]  Weixiong Zhang,et al.  Distributed Stochastic Search for Constraint Satisfaction and Optimization: Parallelism, Phase Transitions and Performance , 2002 .

[28]  Makoto Yokoo,et al.  The Distributed Constraint Satisfaction Problem: Formalization and Algorithms , 1998, IEEE Trans. Knowl. Data Eng..

[29]  Weixiong Zhang,et al.  Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks , 2005, Artif. Intell..

[30]  Shmuel Katz,et al.  On the Feasibility of Distributed Constraint Satisfaction , 1991, IJCAI.

[31]  Makoto Yokoo,et al.  Privacy stochastic games in distributed constraint reasoning , 2019, Annals of Mathematics and Artificial Intelligence.

[32]  Tamir Tassa,et al.  Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs , 2019, Artif. Intell..

[33]  Yves Deville,et al.  The Smart Table Constraint , 2015, CPAIOR.

[34]  Amnon Meisels,et al.  Asymmetric Distributed Constraint Optimization Problems , 2013, J. Artif. Intell. Res..

[35]  Michael D. Smith,et al.  SSDPOP: improving the privacy of DCOP with secret sharing , 2007, AAMAS '07.

[36]  Boi Faltings,et al.  Open constraint programming , 2005, Artif. Intell..