{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T19:15:54Z","timestamp":1776453354592,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662489949","type":"print"},{"value":"9783662489956","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/2.5"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48995-6_21","type":"book-chapter","created":{"date-parts":[[2015,12,8]],"date-time":"2015-12-08T18:37:29Z","timestamp":1449599849000},"page":"286-299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Privacy and Truthful Equilibrium Selection for Aggregative Games"],"prefix":"10.1007","author":[{"given":"Rachel","family":"Cummings","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kearns","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aaron","family":"Roth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiwei Steven","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,30]]},"reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.4086\/toc.2012.v008a006","volume":"8","author":"S Arora","year":"2012","unstructured":"Arora, S., Hazan, E., Kale, S.: The multiplicative weights update method: a meta-algorithm and applications. Theory Comput. 8(1), 121\u2013164 (2012)","journal-title":"Theory Comput."},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.geb.2008.11.005","volume":"67","author":"I Ashlagi","year":"2009","unstructured":"Ashlagi, I., Monderer, D., Tennenholtz, M.: Mediators in position auctions. Games Econ. Behav. 67(1), 2\u201321 (2009)","journal-title":"Games Econ. Behav."},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Azevedo, E.M., Budish, E.: Strategyproofness in the large as a desideratum for market design. In: Proceedings of the 13th ACM Conference on Electronic Commerce, EC 2012, p. 55 (2012)","DOI":"10.1145\/2229012.2229021"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Babichenko, Y.: Best-reply dynamic in large aggregative games. SSRN (2013). abstract 2210080","DOI":"10.2139\/ssrn.2210080"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Barman, S., Ligett, K.: Finding any nontrivial coarse correlated equilibrium is hard. In: Proceedings of the Sixteenth ACM Conference on Economics and Computation, EC 2015, pp. 815\u2013816 (2015)","DOI":"10.1145\/2764468.2764497"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Blum, A., Morgenstern, J., Sharma, A., Smith, A.: Privacy-preserving public information for sequential games. In: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, ITCS 2015, pp. 173\u2013180 (2015)","DOI":"10.1145\/2688073.2688100"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Chen, X., Durfee, D., Orfanou, A.: On the complexity of Nash equilibria in anonymous games. In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, pp. 381\u2013390 (2015)","DOI":"10.1145\/2746539.2746571"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Chen, Y., Chong, S., Kash, I.A., Moran, T., Vadhan, S.: Truthful mechanisms for agents that value privacy. In: Proceedings of the 14th ACM Conference on Electronic Commerce, EC 2013, pp. 215\u2013232 (2013)","DOI":"10.1145\/2492002.2482549"},{"key":"21_CR9","unstructured":"Cummings, R., Kearns, M., Roth, A., Wu, Z.S.: Privacy and truthful equilibrium selection for aggregative games, CoRR, abs\/1407.7740 (2014)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Papadimitriou, C.H.: Discretized multinomial distributions and Nash equilibria in anonymous games. In: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, pp. 25\u201334 (2008)","DOI":"10.1109\/FOCS.2008.84"},{"issue":"3\u20134","key":"21_CR11","first-page":"211","volume":"9","author":"C Dwork","year":"2014","unstructured":"Dwork, C., Roth, A.: The algorithmic foundations of differential privacy. Found. Trends Theoret. Comput. Sci. 9(3\u20134), 211\u2013407 (2014)","journal-title":"Found. Trends Theoret. Comput. Sci."},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Theory of Cryptography","author":"C Dwork","year":"2006","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265\u2013284. Springer, Heidelberg (2006)"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Reingold, O., Rothblum, G.N., Vadhan, S.: On the complexity of differentially private data release: efficient algorithms and hardness results. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, pp. 381\u2013390 (2009)","DOI":"10.1145\/1536414.1536467"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Dwork, C., Rothblum, G.N., Vadhan, S.: Boosting and differential privacy. In: Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, pp. 51\u201360 (2010)","DOI":"10.1109\/FOCS.2010.12"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Ghosh, A., Ligett, K.: Privacy and coordination: computing on databases with endogenous participation. In: Proceedings of the 14th ACM Conference on Electronic Commerce, EC 2013, pp. 543\u2013560 (2013)","DOI":"10.1145\/2492002.2482585"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Hardt, M., Rothblum, G.N.: A multiplicative weights mechanism for privacy-preserving data analysis. In: Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, pp. 61\u201370 (2010)","DOI":"10.1109\/FOCS.2010.85"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1007\/978-3-662-43948-7_51","volume-title":"Automata, Languages, and Programming","author":"J Hsu","year":"2014","unstructured":"Hsu, J., Roth, A., Roughgarden, T., Ullman, J.: Privately solving linear programs. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 612\u2013624. Springer, Heidelberg (2014)"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Kannan, S., Morgenstern, J., Roth, A., Wu, Z.S.: Approximately stable, school optimal, and student-truthful many-to-one matchings (via differential privacy). In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, pp. 1890\u20131903 (2015)","DOI":"10.1137\/1.9781611973730.126"},{"key":"21_CR19","unstructured":"Kearns, M., Mansour, Y.: Efficient Nash computation in large population games with bounded influence. In: Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence, UAI 2002, pp. 259\u2013266 (2002)"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Kearns, M., Pai, M., Roth, A., Ullman, J.: Mechanism design in large games: incentives and privacy. In: Proceedings of the 5th Conference on Innovations in Theoretical Computer Science, ITCS 2014, pp. 403\u2013410 (2014)","DOI":"10.1145\/2554797.2554834"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2007, pp. 94\u2013103 (2007)","DOI":"10.1109\/FOCS.2007.66"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Monderer, D., Tennenholtz, M.: k-implementation. In: Proceedings of the 4th ACM Conference on Electronic Commerce, EC 2003, pp. 19\u201328 (2003)","DOI":"10.1145\/779928.779931"},{"issue":"1","key":"21_CR23","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.artint.2008.10.005","volume":"173","author":"D Monderer","year":"2009","unstructured":"Monderer, D., Tennenholtz, M.: Strong mediated equilibrium. Artif. Intell. 173(1), 180\u2013195 (2009)","journal-title":"Artif. Intell."},{"issue":"1","key":"21_CR24","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"RB Roger","year":"1981","unstructured":"Roger, R.B.: Optimal auction design. Math. Oper. Res. 6(1), 58\u201373 (1981)","journal-title":"Math. Oper. Res."},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Nissim, K., Orlandi, C., Smorodinsky, R.: Privacy-aware mechanism design. In: Proceedings of the 13th ACM Conference on Electronic Commerce, EC 2012, pp. 774\u2013789 (2012)","DOI":"10.1145\/2229012.2229073"},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"Nissim, K., Smorodinsky, R., Tennenholtz, M.: Approximately optimal mechanism design via differential privacy. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS 2012, pp. 203\u2013213 (2012)","DOI":"10.1145\/2090236.2090254"},{"issue":"1","key":"21_CR27","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/2509013.2509016","volume":"12","author":"MM Pai","year":"2013","unstructured":"Pai, M.M., Roth, A.: Privacy and mechanism design. SIGecom Exch. 12(1), 8\u201329 (2013)","journal-title":"SIGecom Exch."},{"key":"21_CR28","doi-asserted-by":"crossref","unstructured":"Rogers, R.M., Roth, A.: Asymptotically truthful equilibrium selection in large congestion games. In: Proceedings of the 15th ACM Conference on Economics and Computation, EC 2014, pp. 771\u2013782 (2014)","DOI":"10.1145\/2600057.2602856"},{"key":"21_CR29","doi-asserted-by":"crossref","unstructured":"Xiao, D.: Is privacy compatible with truthfulness? In: Proceedings of the 4th Conference on Innovations in Theoretical Computer Science, ITCS 2013, pp. 67\u201386 (2013)","DOI":"10.1145\/2422436.2422448"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48995-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,28]],"date-time":"2023-12-28T09:13:10Z","timestamp":1703754790000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48995-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489949","9783662489956"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48995-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"30 December 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}