ACM Home Page
Please provide us with feedback. Feedback
An overview of privacy improvements to k-optimal DCOP algorithms
Full text PdfPdf (166 KB)
Source
International Conference on Autonomous Agents archive
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 table of contents
Budapest, Hungary
SESSION: Interactions table of contents
Pages 1279-1280  
Year of Publication: 2009
ISBN:978-0-9817381-7-8
Author
Rachel Greenstadt  Drexel University, Philadelphia, PA
Sponsors
: The Foundation for Intelligent Physical Agents
Microsoft Research : Microsoft Research
: Whitestein Technologies
: European Office of Aerospace Research and Development, Air Force Office of Scientific Research, United States Air Force Research Laboratory
: Drexel University
: Wiley -- Blackwell Ltd
Publisher
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 14,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

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 produce 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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
S. Fitzpatrick and L. Meertens. Distributed coordination through anarchic optimization. In Distributed Sensor Networks: A Multiagent Perspective. Kluwer Academic Publishers, 2003.
 
2
R. Greenstadt, B. Grosz, and M. Smith. Ssdpop: Improving the privacy of dcop with secret sharing. In DCR, 2007.
 
3
 
4
H. Katagishi and J. Pearce. Kopt: Distributed dcop algorithm for arbitrary k-optima with monotonically increasing utility. In DCR, 2007.
 
5
 
6
R. Maheswaran, J. Pearce, and M. Tambe. Distributed algorithms for dcop: A graphical-game-based approach. In PDCS, 2004.
 
7
A. Petcu and B. Faltings. A scalable method for multiagent constraint optimization. In IJCAI, 2005.
 
8
 
9