Skip to Main content Skip to Navigation
Journal articles

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

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03396233
Contributor : Kathleen Torck Connect in order to contact the contributor
Submitted on : Friday, October 22, 2021 - 4:14:08 PM
Last modification on : Friday, October 29, 2021 - 1:26:03 PM

Identifiers

Collections

Citation

Julien Vion, René Mandiau, Sylvain Piechowiak, Marius Silaghi. Integrating domain and constraint privacy reasoning in the distributed stochastic algorithm with breakouts. Annals of Mathematics and Artificial Intelligence, Springer Verlag, 2021, ⟨10.1007/s10472-021-09735-5⟩. ⟨hal-03396233⟩

Share

Metrics

Record views

6