Document Open Access Logo

Scalable and Jointly Differentially Private Packing

Authors Zhiyi Huang, Xue Zhu

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICALP.2019.73.pdf
  • Filesize: 491 kB
  • 12 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Design and analysis of algorithms
  • Theory of computation → Packing and covering problems
Keywords
  • Joint differential privacy
  • packing
  • scalable algorithms

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We introduce an (epsilon, delta)-jointly differentially private algorithm for packing problems. Our algorithm not only achieves the optimal trade-off between the privacy parameter epsilon and the minimum supply requirement (up to logarithmic factors), but is also scalable in the sense that the running time is linear in the number of agents n. Previous algorithms either run in cubic time in n, or require a minimum supply per resource that is sqrt{n} times larger than the best possible.

Cite As Get BibTex

Zhiyi Huang and Xue Zhu. Scalable and Jointly Differentially Private Packing. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 73:1-73:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019) https://doi.org/10.4230/LIPIcs.ICALP.2019.73

Author Details

Zhiyi Huang
  • The University of Hong Kong
Xue Zhu
  • The University of Hong Kong

Funding

  • Huang, Zhiyi: This work is supported in by a RGC grant HKU17203717E.

References

  1. SN Afriat. Theory of maxima and the method of Lagrange. SIAM Journal on Applied Mathematics, 20(3):343-357, 1971. Google Scholar
  2. Shipra Agrawal and Nikhil R Devanur. Fast algorithms for online stochastic convex programming. In SODA, pages 1405-1424. SIAM, 2014. Google Scholar
  3. Raef Bassily and Adam Smith. Local, private, efficient protocols for succinct histograms. In STOC, pages 127-135. ACM, 2015. Google Scholar
  4. TH Hubert Chan, Elaine Shi, and Dawn Song. Private and continual release of statistics. In ICALP, pages 405-417. Springer, 2010. Google Scholar
  5. Rachel Cummings, Stratis Ioannidis, and Katrina Ligett. Truthful linear regression. In COLT, pages 448-483, 2015. Google Scholar
  6. Rachel Cummings, Michael Kearns, Aaron Roth, and Zhiwei Steven Wu. Privacy and truthful equilibrium selection for aggregative games. In WINE, pages 286-299. Springer, 2015. Google Scholar
  7. Rachel Cummings, Katrina Ligett, Jaikumar Radhakrishnan, Aaron Roth, and Zhiwei Steven Wu. Coordination complexity: Small information coordinating large populations. In ITCS, pages 281-290. ACM, 2016. Google Scholar
  8. Rachel Cummings, David M Pennock, and Jennifer Wortman Vaughan. The possibilities and limitations of private prediction markets. In EC, pages 143-160. ACM, 2016. Google Scholar
  9. John C Duchi, Michael I Jordan, and Martin J Wainwright. Local privacy and statistical minimax rates. In FOCS, pages 429-438. IEEE, 2013. Google Scholar
  10. Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith. Calibrating noise to sensitivity in private data analysis. In TCC, pages 265-284. Springer, 2006. Google Scholar
  11. Cynthia Dwork, Moni Naor, Toniann Pitassi, and Guy N Rothblum. Differential privacy under continual observation. In STOC, pages 715-724. ACM, 2010. Google Scholar
  12. Cynthia Dwork and Aaron Roth. The algorithmic foundations of differential privacy. Foundations and Trendsregistered in Theoretical Computer Science, 9(3-4):211-407, 2014. Google Scholar
  13. Arpita Ghosh, Katrina Ligett, Aaron Roth, and Grant Schoenebeck. Buying private data without verification. In EC, pages 931-948. ACM, 2014. Google Scholar
  14. Justin Hsu, Zhiyi Huang, Aaron Roth, Tim Roughgarden, and Zhiwei Steven Wu. Private matchings and allocations. SIAM Journal on Computing, 45(6):1953-1984, 2016. Google Scholar
  15. Justin Hsu, Zhiyi Huang, Aaron Roth, and Zhiwei Steven Wu. Jointly private convex programming. In SODA, pages 580-599. SIAM, 2016. Google Scholar
  16. Justin Hsu, Aaron Roth, Tim Roughgarden, and Jonathan Ullman. Privately solving linear programs. In ICALP, pages 612-624. Springer, 2014. Google Scholar
  17. Zhiyi Huang and Xue Zhu. Near optimal jointly private packing algorithms via dual multiplicative weight update. In SODA, pages 343-357. SIAM, 2018. Google Scholar
  18. Zhiyi Huang and Xue Zhu. Scalable and Jointly Differentially Private Packing. CoRR, abs/1905.00767, 2019. URL: http://arxiv.org/abs/1905.00767.
  19. Michael Kearns, Mallesh Pai, Aaron Roth, and Jonathan Ullman. Mechanism design in large games: incentives and privacy. In ITCS, pages 403-410. ACM, 2014. Google Scholar
  20. Christos Koufogiannakis and Neal E Young. A nearly linear-time PTAS for explicit fractional packing and covering linear programs. Algorithmica, 70(4):648-674, 2014. Google Scholar
  21. Jinyan Liu, Zhiyi Huang, and Xiangning Wang. Learning Optimal Reserve Price against Non-myopic Bidders. In NeurIPS, pages 2042-2052, 2018. Google Scholar
  22. Frank McSherry and Kunal Talwar. Mechanism Design via Differential Privacy. In FOCS, pages 94-103. IEEE Computer Society, 2007. Google Scholar
  23. Ryan Rogers, Aaron Roth, Jonathan Ullman, and Zhiwei Steven Wu. Inducing approximately optimal flow using truthful mediators. In EC, pages 471-488. ACM, 2015. Google Scholar
  24. Ryan M Rogers and Aaron Roth. Asymptotically truthful equilibrium selection in large congestion games. In EC, pages 771-782. ACM, 2014. Google Scholar
  25. Roshan Shariff and Or Sheffet. Differentially Private Contextual Linear Bandits. In NeurIPS, pages 4301-4311, 2018. Google Scholar
  26. Shang-Hua Teng. Scalable algorithms for data and network analysis. Foundations and Trendsregistered in Theoretical Computer Science, 12(1-2):1-274, 2016. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact