Distributed private Constraint Optimization

Prashant Doshi, Toshihiro Matsui, Marius Silaghi, Makoto Yokoo, Markus Zanker

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

We merge two popular optimization criteria of Distributed Constraint Optimization Problems (DCOPs) - reward-based utility and privacy - into a single criterion. Privacy requirements on constraints has classically motivated an optimization criterion of minimizing the number of disclosed tuples, or maximizing the entropy about constraints. Common complete DCOP search techniques seek solutions minimizing the cost and maintaining some privacy. We start from the observation that for some problems we could provide as input a quantification of loss of privacy in terms of cost. We provide a formal way to integrate this new input parameter into the DCOP framework, discuss its implications and advantages.

Original languageEnglish
Title of host publicationProceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008
Pages277-281
Number of pages5
DOIs
Publication statusPublished - Dec 1 2008
Event2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008 - Sydney, NSW, Australia
Duration: Dec 9 2008Dec 12 2008

Publication series

NameProceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008

Other

Other2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008
CountryAustralia
CitySydney, NSW
Period12/9/0812/12/08

Fingerprint

Costs
Entropy

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Software

Cite this

Doshi, P., Matsui, T., Silaghi, M., Yokoo, M., & Zanker, M. (2008). Distributed private Constraint Optimization. In Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008 (pp. 277-281). [4740633] (Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008). https://doi.org/10.1109/WIIAT.2008.426

Distributed private Constraint Optimization. / Doshi, Prashant; Matsui, Toshihiro; Silaghi, Marius; Yokoo, Makoto; Zanker, Markus.

Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008. 2008. p. 277-281 4740633 (Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Doshi, P, Matsui, T, Silaghi, M, Yokoo, M & Zanker, M 2008, Distributed private Constraint Optimization. in Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008., 4740633, Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008, pp. 277-281, 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008, Sydney, NSW, Australia, 12/9/08. https://doi.org/10.1109/WIIAT.2008.426
Doshi P, Matsui T, Silaghi M, Yokoo M, Zanker M. Distributed private Constraint Optimization. In Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008. 2008. p. 277-281. 4740633. (Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008). https://doi.org/10.1109/WIIAT.2008.426
Doshi, Prashant ; Matsui, Toshihiro ; Silaghi, Marius ; Yokoo, Makoto ; Zanker, Markus. / Distributed private Constraint Optimization. Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008. 2008. pp. 277-281 (Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008).
@inproceedings{5a43968563104993907f2b5728543375,
title = "Distributed private Constraint Optimization",
abstract = "We merge two popular optimization criteria of Distributed Constraint Optimization Problems (DCOPs) - reward-based utility and privacy - into a single criterion. Privacy requirements on constraints has classically motivated an optimization criterion of minimizing the number of disclosed tuples, or maximizing the entropy about constraints. Common complete DCOP search techniques seek solutions minimizing the cost and maintaining some privacy. We start from the observation that for some problems we could provide as input a quantification of loss of privacy in terms of cost. We provide a formal way to integrate this new input parameter into the DCOP framework, discuss its implications and advantages.",
author = "Prashant Doshi and Toshihiro Matsui and Marius Silaghi and Makoto Yokoo and Markus Zanker",
year = "2008",
month = "12",
day = "1",
doi = "10.1109/WIIAT.2008.426",
language = "English",
isbn = "9780769534961",
series = "Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008",
pages = "277--281",
booktitle = "Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008",

}

TY - GEN

T1 - Distributed private Constraint Optimization

AU - Doshi, Prashant

AU - Matsui, Toshihiro

AU - Silaghi, Marius

AU - Yokoo, Makoto

AU - Zanker, Markus

PY - 2008/12/1

Y1 - 2008/12/1

N2 - We merge two popular optimization criteria of Distributed Constraint Optimization Problems (DCOPs) - reward-based utility and privacy - into a single criterion. Privacy requirements on constraints has classically motivated an optimization criterion of minimizing the number of disclosed tuples, or maximizing the entropy about constraints. Common complete DCOP search techniques seek solutions minimizing the cost and maintaining some privacy. We start from the observation that for some problems we could provide as input a quantification of loss of privacy in terms of cost. We provide a formal way to integrate this new input parameter into the DCOP framework, discuss its implications and advantages.

AB - We merge two popular optimization criteria of Distributed Constraint Optimization Problems (DCOPs) - reward-based utility and privacy - into a single criterion. Privacy requirements on constraints has classically motivated an optimization criterion of minimizing the number of disclosed tuples, or maximizing the entropy about constraints. Common complete DCOP search techniques seek solutions minimizing the cost and maintaining some privacy. We start from the observation that for some problems we could provide as input a quantification of loss of privacy in terms of cost. We provide a formal way to integrate this new input parameter into the DCOP framework, discuss its implications and advantages.

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

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

U2 - 10.1109/WIIAT.2008.426

DO - 10.1109/WIIAT.2008.426

M3 - Conference contribution

AN - SCOPUS:62949230426

SN - 9780769534961

T3 - Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008

SP - 277

EP - 281

BT - Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008

ER -