Analysis of privacy loss in distributed constraint optimization

Rachel Greenstadt, Jonathan P. Pearce, Milind Tambe

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

    Abstract

    Distributed Constraint Optimization (DCOP) is rapidly emerging as a prominent technique for multiagent coordination. However, despite agent privacy being a key motivation for applying DCOPs in many applications, rigorous quantitative evaluations of privacy loss in DCOP algorithms have been lacking. Recently, [Maheswaran et al. 2005] introduced a framework for quantitative evaluations of privacy in DCOP algorithms, showing that some DCOP algorithms lose more privacy than purely centralized approaches and questioning the motivation for applying DCOPs. This paper addresses the question of whether state-of-the art DCOP algorithms suffer from a similar shortcoming by investigating several of the most efficient DCOP algorithms, including both DPOP and ADOPT. Furthermore, while previous work investigated the impact on efficiency of distributed contraint reasoning design decisions (e.g. constraint-graph topology, asynchrony, message-contents), this paper examines the privacy aspect of such decisions, providing an improved understanding of privacy-efficiency tradeoffs.

    Original languageEnglish (US)
    Title of host publicationProceedings of the 21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, AAAI-06/IAAI-06
    Pages647-653
    Number of pages7
    StatePublished - Nov 13 2006
    Event21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, AAAI-06/IAAI-06 - Boston, MA, United States
    Duration: Jul 16 2006Jul 20 2006

    Publication series

    NameProceedings of the National Conference on Artificial Intelligence
    Volume1

    Conference

    Conference21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, AAAI-06/IAAI-06
    CountryUnited States
    CityBoston, MA
    Period7/16/067/20/06

    Fingerprint

    Topology

    ASJC Scopus subject areas

    • Software
    • Artificial Intelligence

    Cite this

    Greenstadt, R., Pearce, J. P., & Tambe, M. (2006). Analysis of privacy loss in distributed constraint optimization. In Proceedings of the 21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, AAAI-06/IAAI-06 (pp. 647-653). (Proceedings of the National Conference on Artificial Intelligence; Vol. 1).

    Analysis of privacy loss in distributed constraint optimization. / Greenstadt, Rachel; Pearce, Jonathan P.; Tambe, Milind.

    Proceedings of the 21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, AAAI-06/IAAI-06. 2006. p. 647-653 (Proceedings of the National Conference on Artificial Intelligence; Vol. 1).

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

    Greenstadt, R, Pearce, JP & Tambe, M 2006, Analysis of privacy loss in distributed constraint optimization. in Proceedings of the 21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, AAAI-06/IAAI-06. Proceedings of the National Conference on Artificial Intelligence, vol. 1, pp. 647-653, 21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, AAAI-06/IAAI-06, Boston, MA, United States, 7/16/06.
    Greenstadt R, Pearce JP, Tambe M. Analysis of privacy loss in distributed constraint optimization. In Proceedings of the 21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, AAAI-06/IAAI-06. 2006. p. 647-653. (Proceedings of the National Conference on Artificial Intelligence).
    Greenstadt, Rachel ; Pearce, Jonathan P. ; Tambe, Milind. / Analysis of privacy loss in distributed constraint optimization. Proceedings of the 21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, AAAI-06/IAAI-06. 2006. pp. 647-653 (Proceedings of the National Conference on Artificial Intelligence).
    @inproceedings{8c96d412159c47e497483601e8408711,
    title = "Analysis of privacy loss in distributed constraint optimization",
    abstract = "Distributed Constraint Optimization (DCOP) is rapidly emerging as a prominent technique for multiagent coordination. However, despite agent privacy being a key motivation for applying DCOPs in many applications, rigorous quantitative evaluations of privacy loss in DCOP algorithms have been lacking. Recently, [Maheswaran et al. 2005] introduced a framework for quantitative evaluations of privacy in DCOP algorithms, showing that some DCOP algorithms lose more privacy than purely centralized approaches and questioning the motivation for applying DCOPs. This paper addresses the question of whether state-of-the art DCOP algorithms suffer from a similar shortcoming by investigating several of the most efficient DCOP algorithms, including both DPOP and ADOPT. Furthermore, while previous work investigated the impact on efficiency of distributed contraint reasoning design decisions (e.g. constraint-graph topology, asynchrony, message-contents), this paper examines the privacy aspect of such decisions, providing an improved understanding of privacy-efficiency tradeoffs.",
    author = "Rachel Greenstadt and Pearce, {Jonathan P.} and Milind Tambe",
    year = "2006",
    month = "11",
    day = "13",
    language = "English (US)",
    isbn = "1577352815",
    series = "Proceedings of the National Conference on Artificial Intelligence",
    pages = "647--653",
    booktitle = "Proceedings of the 21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, AAAI-06/IAAI-06",

    }

    TY - GEN

    T1 - Analysis of privacy loss in distributed constraint optimization

    AU - Greenstadt, Rachel

    AU - Pearce, Jonathan P.

    AU - Tambe, Milind

    PY - 2006/11/13

    Y1 - 2006/11/13

    N2 - Distributed Constraint Optimization (DCOP) is rapidly emerging as a prominent technique for multiagent coordination. However, despite agent privacy being a key motivation for applying DCOPs in many applications, rigorous quantitative evaluations of privacy loss in DCOP algorithms have been lacking. Recently, [Maheswaran et al. 2005] introduced a framework for quantitative evaluations of privacy in DCOP algorithms, showing that some DCOP algorithms lose more privacy than purely centralized approaches and questioning the motivation for applying DCOPs. This paper addresses the question of whether state-of-the art DCOP algorithms suffer from a similar shortcoming by investigating several of the most efficient DCOP algorithms, including both DPOP and ADOPT. Furthermore, while previous work investigated the impact on efficiency of distributed contraint reasoning design decisions (e.g. constraint-graph topology, asynchrony, message-contents), this paper examines the privacy aspect of such decisions, providing an improved understanding of privacy-efficiency tradeoffs.

    AB - Distributed Constraint Optimization (DCOP) is rapidly emerging as a prominent technique for multiagent coordination. However, despite agent privacy being a key motivation for applying DCOPs in many applications, rigorous quantitative evaluations of privacy loss in DCOP algorithms have been lacking. Recently, [Maheswaran et al. 2005] introduced a framework for quantitative evaluations of privacy in DCOP algorithms, showing that some DCOP algorithms lose more privacy than purely centralized approaches and questioning the motivation for applying DCOPs. This paper addresses the question of whether state-of-the art DCOP algorithms suffer from a similar shortcoming by investigating several of the most efficient DCOP algorithms, including both DPOP and ADOPT. Furthermore, while previous work investigated the impact on efficiency of distributed contraint reasoning design decisions (e.g. constraint-graph topology, asynchrony, message-contents), this paper examines the privacy aspect of such decisions, providing an improved understanding of privacy-efficiency tradeoffs.

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

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

    M3 - Conference contribution

    AN - SCOPUS:33750742251

    SN - 1577352815

    SN - 9781577352815

    T3 - Proceedings of the National Conference on Artificial Intelligence

    SP - 647

    EP - 653

    BT - Proceedings of the 21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, AAAI-06/IAAI-06

    ER -