ملخص
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, فرنسا المدة: ٥ مايو ٢٠١٤ → ٩ مايو ٢٠١٤ |
سلسلة المنشورات
| الاسم | 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014 |
|---|---|
| مستوى الصوت | 2 |
!!Conference
| !!Conference | 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014 |
|---|---|
| الدولة/الإقليم | فرنسا |
| المدينة | Paris |
| المدة | ٥/٠٥/١٤ → ٩/٠٥/١٤ |
ملاحظة ببليوغرافية
Publisher Copyright:Copyright © 2014, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved.