Privacy has been a major concern for agents in distributed constraint reasoning. In this work, we approach this issue in distributed constraint reasoning by letting agents compromise solution quality for preserving privacy, using utility theory. We formalize privacy in the context of distributed constraint reasoning, detail its different aspects, and present model and solvers, as well as their properties. We then show how distributed constraint reasoning with privacy requirements can be modelled as a planning problem, and more specifically as a stochastic game.
|出版ステータス||出版済み - 2018|
|イベント||2018 International Symposium on Artificial Intelligence and Mathematics, ISAIM 2018 - Fort Lauderdale, 米国|
継続期間: 1 3 2018 → 1 5 2018
|会議||2018 International Symposium on Artificial Intelligence and Mathematics, ISAIM 2018|
|Period||1/3/18 → 1/5/18|
All Science Journal Classification (ASJC) codes