|
||||||||||||||||||||||||||||||||||||||||||||||
|
||||||||||||||||||||||||||||||||||||||||||||||
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.
INDEX TERMS
Primary Classification:
General Terms:
Keywords:
|
||||||||||||||||||||||||||||||||||||||||||||||