Utilitarian approach to privacy in distributed constraint optimization problems

Julien Savaux, Julien Vion, Sylvain Piechowiak, Réne Mandiau, Toshihiro Matsui, Katsutoshi Hirayama, Makoto Yokoo, Shakre Elmane, Marius Silaghi

研究成果: 著書/レポートタイプへの貢献会議での発言

2 引用 (Scopus)

抄録

Privacy has been a major motivation for distributed problem optimization. However, even though several methods have been proposed to evaluate it, none of them is widely used. The Distributed Constraint Optimization Problem (DCOP) is a fundamental model used to approach various families of distributed problems. Here we approach the problem by letting both the optimized costs found in DCOPs and the privacy requirements guide the agents' exploration of the search space. We introduce Utilitarian Distributed Constraint Optimization Problem (UDCOP) where the costs and the privacy requirements are used as parameters to a heuristic modifying the search process. Common stochastic algorithms for decentralized constraint optimization problems are evaluated here according to how well they preserve privacy.

元の言語英語
ホスト出版物のタイトルFLAIRS 2017 - Proceedings of the 30th International Florida Artificial Intelligence Research Society Conference
出版者AAAI Press
ページ454-459
ページ数6
ISBN(電子版)9781577357872
出版物ステータス出版済み - 1 1 2017
イベント30th International Florida Artificial Intelligence Research Society Conference, FLAIRS 2017 - Marco Island, 米国
継続期間: 5 22 20175 24 2017

その他

その他30th International Florida Artificial Intelligence Research Society Conference, FLAIRS 2017
米国
Marco Island
期間5/22/175/24/17

Fingerprint

Costs

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Software

これを引用

Savaux, J., Vion, J., Piechowiak, S., Mandiau, R., Matsui, T., Hirayama, K., ... Silaghi, M. (2017). Utilitarian approach to privacy in distributed constraint optimization problems. : FLAIRS 2017 - Proceedings of the 30th International Florida Artificial Intelligence Research Society Conference (pp. 454-459). AAAI Press.

Utilitarian approach to privacy in distributed constraint optimization problems. / Savaux, Julien; Vion, Julien; Piechowiak, Sylvain; Mandiau, Réne; Matsui, Toshihiro; Hirayama, Katsutoshi; Yokoo, Makoto; Elmane, Shakre; Silaghi, Marius.

FLAIRS 2017 - Proceedings of the 30th International Florida Artificial Intelligence Research Society Conference. AAAI Press, 2017. p. 454-459.

研究成果: 著書/レポートタイプへの貢献会議での発言

Savaux, J, Vion, J, Piechowiak, S, Mandiau, R, Matsui, T, Hirayama, K, Yokoo, M, Elmane, S & Silaghi, M 2017, Utilitarian approach to privacy in distributed constraint optimization problems. : FLAIRS 2017 - Proceedings of the 30th International Florida Artificial Intelligence Research Society Conference. AAAI Press, pp. 454-459, 30th International Florida Artificial Intelligence Research Society Conference, FLAIRS 2017, Marco Island, 米国, 5/22/17.
Savaux J, Vion J, Piechowiak S, Mandiau R, Matsui T, Hirayama K その他. Utilitarian approach to privacy in distributed constraint optimization problems. : FLAIRS 2017 - Proceedings of the 30th International Florida Artificial Intelligence Research Society Conference. AAAI Press. 2017. p. 454-459
Savaux, Julien ; Vion, Julien ; Piechowiak, Sylvain ; Mandiau, Réne ; Matsui, Toshihiro ; Hirayama, Katsutoshi ; Yokoo, Makoto ; Elmane, Shakre ; Silaghi, Marius. / Utilitarian approach to privacy in distributed constraint optimization problems. FLAIRS 2017 - Proceedings of the 30th International Florida Artificial Intelligence Research Society Conference. AAAI Press, 2017. pp. 454-459
@inproceedings{1e6f8f0f675f43f381001b5eaebbbc0f,
title = "Utilitarian approach to privacy in distributed constraint optimization problems",
abstract = "Privacy has been a major motivation for distributed problem optimization. However, even though several methods have been proposed to evaluate it, none of them is widely used. The Distributed Constraint Optimization Problem (DCOP) is a fundamental model used to approach various families of distributed problems. Here we approach the problem by letting both the optimized costs found in DCOPs and the privacy requirements guide the agents' exploration of the search space. We introduce Utilitarian Distributed Constraint Optimization Problem (UDCOP) where the costs and the privacy requirements are used as parameters to a heuristic modifying the search process. Common stochastic algorithms for decentralized constraint optimization problems are evaluated here according to how well they preserve privacy.",
author = "Julien Savaux and Julien Vion and Sylvain Piechowiak and R{\'e}ne Mandiau and Toshihiro Matsui and Katsutoshi Hirayama and Makoto Yokoo and Shakre Elmane and Marius Silaghi",
year = "2017",
month = "1",
day = "1",
language = "English",
pages = "454--459",
booktitle = "FLAIRS 2017 - Proceedings of the 30th International Florida Artificial Intelligence Research Society Conference",
publisher = "AAAI Press",

}

TY - GEN

T1 - Utilitarian approach to privacy in distributed constraint optimization problems

AU - Savaux, Julien

AU - Vion, Julien

AU - Piechowiak, Sylvain

AU - Mandiau, Réne

AU - Matsui, Toshihiro

AU - Hirayama, Katsutoshi

AU - Yokoo, Makoto

AU - Elmane, Shakre

AU - Silaghi, Marius

PY - 2017/1/1

Y1 - 2017/1/1

N2 - Privacy has been a major motivation for distributed problem optimization. However, even though several methods have been proposed to evaluate it, none of them is widely used. The Distributed Constraint Optimization Problem (DCOP) is a fundamental model used to approach various families of distributed problems. Here we approach the problem by letting both the optimized costs found in DCOPs and the privacy requirements guide the agents' exploration of the search space. We introduce Utilitarian Distributed Constraint Optimization Problem (UDCOP) where the costs and the privacy requirements are used as parameters to a heuristic modifying the search process. Common stochastic algorithms for decentralized constraint optimization problems are evaluated here according to how well they preserve privacy.

AB - Privacy has been a major motivation for distributed problem optimization. However, even though several methods have been proposed to evaluate it, none of them is widely used. The Distributed Constraint Optimization Problem (DCOP) is a fundamental model used to approach various families of distributed problems. Here we approach the problem by letting both the optimized costs found in DCOPs and the privacy requirements guide the agents' exploration of the search space. We introduce Utilitarian Distributed Constraint Optimization Problem (UDCOP) where the costs and the privacy requirements are used as parameters to a heuristic modifying the search process. Common stochastic algorithms for decentralized constraint optimization problems are evaluated here according to how well they preserve privacy.

UR - http://www.scopus.com/inward/record.url?scp=85029498343&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85029498343&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:85029498343

SP - 454

EP - 459

BT - FLAIRS 2017 - Proceedings of the 30th International Florida Artificial Intelligence Research Society Conference

PB - AAAI Press

ER -