Distributed Private Constraint Optimization
Prashant Doshi, Toshihiro Matsui, Marius Calin Silaghi, Makoto Yokoo, Markus Zanker · 2008
We merge two popular optimization criteria of distributed constraint optimization problems (DCOPs) -- reward-based utility and privacy -- into a single criterion. Privacy requirements on constraints has classically motivated an optimization criterion of minimizing the number of disclosed tuples, or maximizing the entropy about constraints. Common complete DCOP search techniques seek solutions minimizing the cost and maintaining some privacy. We start from the observation that for some problems we could provide as input a quantification of loss of privacy in terms of cost. We provide a formal way to integrate this new input parameter into the DCOP framework, discuss its implications and advantages.