{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:15:36Z","timestamp":1750306536796,"version":"3.41.0"},"reference-count":0,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2014,12,8]],"date-time":"2014-12-08T00:00:00Z","timestamp":1417996800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2014,12,8]]},"abstract":"<jats:p>In this talk we overview how differential privacy gives a collection of tools that can be easily applied to design algorithms which enjoy remarkable incentive properties in large systems and markets -- settings in which the number of interacting agents is large, and each of the individual players are \"small\". We illustrate this power with two vignettes -- designing mediators to coordinate equilibrium behavior in games of incomplete information (due to Kearns, Pai, Roth, and Ullman, and Rogers and Roth, 2014), and designing ascending price auctions such that sincere bidding is an asymptotic dominant strategy (due to Huang, Hsu, Roth, Roughgarden, and Wu, 2014).<\/jats:p>\n          <jats:p>In both of these settings, we get good incentive properties under the assumption that the market is \"large\" in some sense. However, we discuss how our methodology (via differential privacy) allows us to make substantially milder \"large market\" assumptions than those commonly appearing in the literature.<\/jats:p>","DOI":"10.1145\/2695533.2695547","type":"journal-article","created":{"date-parts":[[2014,12,8]],"date-time":"2014-12-08T16:17:14Z","timestamp":1418055434000},"page":"39-39","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Differential Privacy as a Tool for Mechanism Design in Large Systems"],"prefix":"10.1145","volume":"42","author":[{"given":"Aaron","family":"Roth","sequence":"first","affiliation":[{"name":"University of Pennsylvania"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,12,8]]},"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2695533.2695547","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2695533.2695547","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:21Z","timestamp":1750227141000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2695533.2695547"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,8]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,12,8]]}},"alternative-id":["10.1145\/2695533.2695547"],"URL":"https:\/\/doi.org\/10.1145\/2695533.2695547","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2014,12,8]]},"assertion":[{"value":"2014-12-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}