תקציר
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.
| שפה מקורית | אנגלית |
|---|---|
| כותר פרסום המארח | 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014 |
| מוציא לאור | International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS) |
| עמודים | 909-916 |
| מספר עמודים | 8 |
| מסת"ב (אלקטרוני) | 9781634391313 |
| סטטוס פרסום | פורסם - 2014 |
| אירוע | 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014 - Paris, צרפת משך הזמן: 5 מאי 2014 → 9 מאי 2014 |
סדרות פרסומים
| שם | 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014 |
|---|---|
| כרך | 2 |
כנס
| כנס | 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014 |
|---|---|
| מדינה/אזור | צרפת |
| עיר | Paris |
| תקופה | 5/05/14 → 9/05/14 |
הערה ביבליוגרפית
Publisher Copyright:Copyright © 2014, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved.