Damle, SankarshanTriastcyn, AlekseiFaltings, BoiGujar, Sujit Prakash2023-02-092023-02-092023-02-092022-04-2010.1145/3486622.3493929https://infoscience.epfl.ch/handle/20.500.14299/194713Several optimization scenarios involve multiple agents that desire to protect the privacy of their preferences. There are distributed algorithms for constraint optimization that provide improved privacy protection through secure multiparty computation. However, it comes at the expense of high computational complexity and does not constitute a rigorous privacy guarantee for optimization outcomes, as the result of the computation itself may compromise agents’ preferences. In this work, we show how to achieve privacy, specifically differential privacy, through the randomization of the solving process. In particular, we present P-Gibbs, which adapts the SD-Gibbs algorithm to obtain differential privacy guarantees with much higher computational efficiency. Experiments on graph coloring and meeting scheduling show the algorithm’s privacy-performance trade-off for varying privacy budgets, and the SD-Gibbs algorithm.text::conference output::conference proceedings::conference paper