Abstract
Distributed constraint optimization problems enable the representation of many combinatorial problems that are distributed by nature. An important motivation for such problems is to preserve the privacy of the participating agents during the solving process. The present paper introduces a novel privacy-preserving algorithm for this purpose. The proposed algorithm requires a secure solution of several multiparty computation problems. Consequently, appropriate novel secure protocols are devised and analyzed.
| Original language | English |
|---|---|
| Title of host publication | 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014 |
| Publisher | International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS) |
| Pages | 909-916 |
| Number of pages | 8 |
| ISBN (Electronic) | 9781634391313 |
| State | Published - 2014 |
| Event | 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014 - Paris, France Duration: 5 May 2014 → 9 May 2014 |
Publication series
| Name | 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014 |
|---|---|
| Volume | 2 |
Conference
| Conference | 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014 |
|---|---|
| Country/Territory | France |
| City | Paris |
| Period | 5/05/14 → 9/05/14 |
Bibliographical note
Publisher Copyright:Copyright © 2014, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved.
Keywords
- Constraint privacy
- DCOP
- Search