An overview of privacy improvements to k-optimal DCOP algorithms

Rachel Greenstadt

An overview of privacy improvements to k-optimal DCOP algorithms

Rachel Greenstadt

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

For agents to be trusted with sensitive data, they must have mechanisms to protect their users' privacy. This paper explores the privacy properties of k-optimal algorithms: Those algorithms that pro-duce locally optimal solutions that cannot be improved by changing the assignments of k or fewer agents. While these algorithms are subject to large amounts of privacy loss, they can be modified to reduce this privacy loss by an order of magnitude. The greatest improvements are achieved by replacing the centralized local search with a distributed algorithm, such as DPOP.

Original language	English (US)
Title of host publication	8th International Joint Conference on Autonomous Agents and Multiagent Systems 2009, AAMAS 2009
Publisher	International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Pages	1282-1283
Number of pages	2
ISBN (Print)	9781615673346
State	Published - 2009
Event	8th International Joint Conference on Autonomous Agents and Multiagent Systems 2009, AAMAS 2009 - Budapest, Hungary Duration: May 10 2009 → May 15 2009

Publication series

Name	Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
Volume	2
ISSN (Print)	1548-8403
ISSN (Electronic)	1558-2914

Conference

Conference	8th International Joint Conference on Autonomous Agents and Multiagent Systems 2009, AAMAS 2009
Country/Territory	Hungary
City	Budapest
Period	5/10/09 → 5/15/09

Keywords

Distributed constraint optimization
Security and privacy

ASJC Scopus subject areas

Artificial Intelligence
Software
Control and Systems Engineering

Cite this

Greenstadt, R. (2009). An overview of privacy improvements to k-optimal DCOP algorithms. In 8th International Joint Conference on Autonomous Agents and Multiagent Systems 2009, AAMAS 2009 (pp. 1282-1283). (Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS; Vol. 2). International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS).

An overview of privacy improvements to k-optimal DCOP algorithms. / Greenstadt, Rachel.
8th International Joint Conference on Autonomous Agents and Multiagent Systems 2009, AAMAS 2009. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2009. p. 1282-1283 (Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS; Vol. 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Greenstadt, R 2009, An overview of privacy improvements to k-optimal DCOP algorithms. in 8th International Joint Conference on Autonomous Agents and Multiagent Systems 2009, AAMAS 2009. Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS, vol. 2, International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), pp. 1282-1283, 8th International Joint Conference on Autonomous Agents and Multiagent Systems 2009, AAMAS 2009, Budapest, Hungary, 5/10/09.

Greenstadt R. An overview of privacy improvements to k-optimal DCOP algorithms. In 8th International Joint Conference on Autonomous Agents and Multiagent Systems 2009, AAMAS 2009. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS). 2009. p. 1282-1283. (Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS).

Greenstadt, Rachel. / An overview of privacy improvements to k-optimal DCOP algorithms. 8th International Joint Conference on Autonomous Agents and Multiagent Systems 2009, AAMAS 2009. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2009. pp. 1282-1283 (Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS).

@inproceedings{14f02552fb7c4e4d984ccfa813ea9d78,

title = "An overview of privacy improvements to k-optimal DCOP algorithms",

abstract = "For agents to be trusted with sensitive data, they must have mechanisms to protect their users' privacy. This paper explores the privacy properties of k-optimal algorithms: Those algorithms that pro-duce locally optimal solutions that cannot be improved by changing the assignments of k or fewer agents. While these algorithms are subject to large amounts of privacy loss, they can be modified to reduce this privacy loss by an order of magnitude. The greatest improvements are achieved by replacing the centralized local search with a distributed algorithm, such as DPOP.",

keywords = "Distributed constraint optimization, Security and privacy",

author = "Rachel Greenstadt",

year = "2009",

language = "English (US)",

isbn = "9781615673346",

series = "Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS",

publisher = "International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)",

pages = "1282--1283",

booktitle = "8th International Joint Conference on Autonomous Agents and Multiagent Systems 2009, AAMAS 2009",

note = "8th International Joint Conference on Autonomous Agents and Multiagent Systems 2009, AAMAS 2009 ; Conference date: 10-05-2009 Through 15-05-2009",

}

TY - GEN

T1 - An overview of privacy improvements to k-optimal DCOP algorithms

AU - Greenstadt, Rachel

PY - 2009

Y1 - 2009

N2 - For agents to be trusted with sensitive data, they must have mechanisms to protect their users' privacy. This paper explores the privacy properties of k-optimal algorithms: Those algorithms that pro-duce locally optimal solutions that cannot be improved by changing the assignments of k or fewer agents. While these algorithms are subject to large amounts of privacy loss, they can be modified to reduce this privacy loss by an order of magnitude. The greatest improvements are achieved by replacing the centralized local search with a distributed algorithm, such as DPOP.

AB - For agents to be trusted with sensitive data, they must have mechanisms to protect their users' privacy. This paper explores the privacy properties of k-optimal algorithms: Those algorithms that pro-duce locally optimal solutions that cannot be improved by changing the assignments of k or fewer agents. While these algorithms are subject to large amounts of privacy loss, they can be modified to reduce this privacy loss by an order of magnitude. The greatest improvements are achieved by replacing the centralized local search with a distributed algorithm, such as DPOP.

KW - Distributed constraint optimization

KW - Security and privacy

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

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

M3 - Conference contribution

AN - SCOPUS:84899833393

SN - 9781615673346

T3 - Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS

SP - 1282

EP - 1283

BT - 8th International Joint Conference on Autonomous Agents and Multiagent Systems 2009, AAMAS 2009

PB - International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)

T2 - 8th International Joint Conference on Autonomous Agents and Multiagent Systems 2009, AAMAS 2009

Y2 - 10 May 2009 through 15 May 2009

ER -

An overview of privacy improvements to k-optimal DCOP algorithms

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this