{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T07:25:09Z","timestamp":1780557909418,"version":"3.54.1"},"publisher-location":"New York, New York, USA","reference-count":28,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"name":"the National Basic Research Program of China Grant","award":["2011CBA00300 2011CBA00301"],"award-info":[{"award-number":["2011CBA00300 2011CBA00301"]}]},{"name":"a Tsinghua Initiative Scientific Research Grant"},{"name":"a China Youth 1000-talent program"},{"name":"the Natural Science Foundation of China Grant","award":["61033001 61361136003 61303077 61561146398"],"award-info":[{"award-number":["61033001 61361136003 61303077 61561146398"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3178876.3186042","type":"proceedings-article","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T15:53:48Z","timestamp":1523634828000},"page":"1369-1378","source":"Crossref","is-referenced-by-count":7,"title":["Incentive-Aware Learning for Large Markets"],"prefix":"10.1145","author":[{"given":"Alessandro","family":"Epasto","sequence":"first","affiliation":[{"name":"Google Research, New York City, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammad","family":"Mahdian","sequence":"additional","affiliation":[{"name":"Google Research, New York City, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vahab","family":"Mirrokni","sequence":"additional","affiliation":[{"name":"Google Research, New York City, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Song","family":"Zuo","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","reference":[{"key":"key-10.1145\/3178876.3186042-1","unstructured":"Kareem Amin, Afshin Rostamizadeh, and Umar Syed . 2013. Learning prices for repeated auctions with strategic buyers Advances in Neural Information Processing Systems. 1169--1177."},{"key":"key-10.1145\/3178876.3186042-2","unstructured":"Kareem Amin, Afshin Rostamizadeh, and Umar Syed . 2014. Repeated contextual auctions with strategic buyers Advances in Neural Information Processing Systems. 622--630."},{"key":"key-10.1145\/3178876.3186042-3","unstructured":"M-F Balcan, Avrim Blum, Jason D Hartline, and Yishay Mansour . 2005. Mechanism design via machine learning. In Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on. IEEE, 605--614."},{"key":"key-10.1145\/3178876.3186042-4","unstructured":"Maria-Florina Balcan, Tuomas Sandholm, and Ellen Vitercik . 2017. Sample Complexity of Multi-Item Profit Maximization. arXiv preprint arXiv:1705.00243 (2017)."},{"key":"key-10.1145\/3178876.3186042-5","doi-asserted-by":"crossref","unstructured":"Eric Budish . 2011. The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. Journal of Political Economy Vol. 119, 6 (2011), 1061--1103.","DOI":"10.1086\/664613"},{"key":"key-10.1145\/3178876.3186042-6","doi-asserted-by":"crossref","unstructured":"Nicolo Cesa-Bianchi, Claudio Gentile, and Yishay Mansour . 2015. Regret minimization for reserve prices in second-price auctions. IEEE Transactions on Information Theory Vol. 61, 1 (2015), 549--564.","DOI":"10.1109\/TIT.2014.2365772"},{"key":"key-10.1145\/3178876.3186042-7","doi-asserted-by":"crossref","unstructured":"Shuchi Chawla, Jason Hartline, and Denis Nekipelov . 2014. Mechanism design for data science. In Proceedings of the fifteenth ACM conference on Economics and computation. ACM, 711--712.","DOI":"10.1145\/2600057.2602881"},{"key":"key-10.1145\/3178876.3186042-8","doi-asserted-by":"crossref","unstructured":"Richard Cole and Tim Roughgarden . 2014. The sample complexity of revenue maximization. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing. ACM, 243--252.","DOI":"10.1145\/2591796.2591867"},{"key":"key-10.1145\/3178876.3186042-9","doi-asserted-by":"crossref","unstructured":"Ofer Dekel, Felix Fischer, and Ariel D Procaccia . 2010. Incentive compatible regression learning. J. Comput. System Sci. Vol. 76, 8 (2010), 759--777.","DOI":"10.1016\/j.jcss.2010.03.003"},{"key":"key-10.1145\/3178876.3186042-10","doi-asserted-by":"crossref","unstructured":"Nikhil R Devanur, Zhiyi Huang, and Christos-Alexandros Psomas . 2015. The sample complexity of auctions with side information. arXiv preprint arXiv:1511.02296 (2015).","DOI":"10.1145\/2897518.2897553"},{"key":"key-10.1145\/3178876.3186042-11","doi-asserted-by":"crossref","unstructured":"Piotr Faliszewski, Edith Hemaspaandra, and Lane A Hemaspaandra . 2010. Using complexity to protect elections. Commun. ACM Vol. 53, 11 (2010), 74--82.","DOI":"10.1145\/1839676.1839696"},{"key":"key-10.1145\/3178876.3186042-12","doi-asserted-by":"crossref","unstructured":"Piotr Faliszewski and Ariel D Procaccia . 2010. AI's war on manipulation: Are we winning? AI Magazine Vol. 31, 4 (2010), 53--64.","DOI":"10.1609\/aimag.v31i4.2314"},{"key":"key-10.1145\/3178876.3186042-13","doi-asserted-by":"crossref","unstructured":"Amos Fiat, Anna Karlin, Elias Koutsoupias, and Angelina Vidali . 2013. Approaching utopia: strong truthfulness and externality-resistant mechanisms Proceedings of the 4th conference on Innovations in Theoretical Computer Science. ACM, 221--230.","DOI":"10.1145\/2422436.2422463"},{"key":"key-10.1145\/3178876.3186042-14","unstructured":"Hu Fu, Nicole Immorlica, Brendan Lucier, and Philipp Strack . 2015. Randomization beats second price as a prior-independent auction Proceedings of the Sixteenth ACM Conference on Economics and Computation. ACM, 323--323."},{"key":"key-10.1145\/3178876.3186042-15","doi-asserted-by":"crossref","unstructured":"Yannai A Gonczarowski and Noam Nisan . 2016. Efficient Empirical Revenue Maximization in Single-Parameter Auction Environments. arXiv preprint arXiv:1610.09976 (2016).","DOI":"10.1145\/3055399.3055427"},{"key":"key-10.1145\/3178876.3186042-16","doi-asserted-by":"crossref","unstructured":"Moritz Hardt, Nimrod Megiddo, Christos Papadimitriou, and Mary Wootters . 2016. Strategic classification. In Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science. ACM, 111--122.","DOI":"10.1145\/2840728.2840730"},{"key":"key-10.1145\/3178876.3186042-17","doi-asserted-by":"crossref","unstructured":"Zhiyi Huang, Yishay Mansour, and Tim Roughgarden . 2015. Making the most of your samples. In Proceedings of the Sixteenth ACM Conference on Economics and Computation. ACM, 45--60.","DOI":"10.1145\/2764468.2764475"},{"key":"key-10.1145\/3178876.3186042-18","doi-asserted-by":"crossref","unstructured":"Yash Kanoria and Hamid Nazerzadeh . 2014. Dynamic reserve prices for repeated auctions: Learning from bids. (2014).","DOI":"10.1007\/978-3-319-13129-0_17"},{"key":"key-10.1145\/3178876.3186042-19","doi-asserted-by":"crossref","unstructured":"Michael Kearns, Mallesh Pai, Aaron Roth, and Jonathan Ullman . 2014. Mechanism design in large games: Incentives and privacy Proceedings of the 5th conference on Innovations in theoretical computer science. ACM, 403--410.","DOI":"10.1145\/2554797.2554834"},{"key":"key-10.1145\/3178876.3186042-20","doi-asserted-by":"crossref","unstructured":"Fuhito Kojima and Parag A Pathak . 2009. Incentives and stability in large two-sided matching markets. The American Economic Review Vol. 99, 3 (2009), 608--627.","DOI":"10.1257\/aer.99.3.608"},{"key":"key-10.1145\/3178876.3186042-21","doi-asserted-by":"crossref","unstructured":"Pinyan Lu, Shang-Hua Teng, and Changyuan Yu . 2006. Truthful auctions with optimal profit. In International Workshop on Internet and Network Economics. Springer, 27--36.","DOI":"10.1007\/11944874_4"},{"key":"key-10.1145\/3178876.3186042-22","doi-asserted-by":"crossref","unstructured":"Frank McSherry and Kunal Talwar . 2007. Mechanism design via differential privacy. In Foundations of Computer Science, 2007. FOCS'07. 48th Annual IEEE Symposium on. IEEE, 94--103.","DOI":"10.1109\/FOCS.2007.66"},{"key":"key-10.1145\/3178876.3186042-23","doi-asserted-by":"crossref","unstructured":"Reshef Meir, Ariel D Procaccia, and Jeffrey S Rosenschein . 2012. Algorithms for strategyproof classification. Artificial Intelligence Vol. 186 (2012), 123--156.","DOI":"10.1016\/j.artint.2012.03.008"},{"key":"key-10.1145\/3178876.3186042-24","unstructured":"Jamie H Morgenstern and Tim Roughgarden . 2015. On the pseudo-dimension of nearly optimal auctions Advances in Neural Information Processing Systems. 136--144."},{"key":"key-10.1145\/3178876.3186042-25","doi-asserted-by":"crossref","unstructured":"Noam Nisan, Tim Roughgarden, Eva Tardos, and Vijay V Vazirani . 2007. Algorithmic game theory. Vol. Vol. 1. Cambridge University Press Cambridge.","DOI":"10.1017\/CBO9780511800481"},{"key":"key-10.1145\/3178876.3186042-26","unstructured":"Kobbi Nissim, Rann Smorodinsky, and Moshe Tennenholtz . 2012. Approximately optimal mechanism design via differential privacy Proceedings of the 3rd innovations in theoretical computer science conference. ACM, 203--213."},{"key":"key-10.1145\/3178876.3186042-27","doi-asserted-by":"crossref","unstructured":"Michael Ostrovsky and Michael Schwarz . 2011. Reserve prices in internet advertising auctions: A field experiment Proceedings of the 12th ACM conference on Electronic commerce. ACM, 59--60.","DOI":"10.1145\/1993574.1993585"},{"key":"key-10.1145\/3178876.3186042-28","unstructured":"Pingzhong Tang and Yulong Zeng . 2016. How to manipulate truthful prior-dependent mechanisms? CoRR Vol. abs\/1606.02409 (2016). deftempurl%http:\/\/arxiv.org\/abs\/1606.02409 tempurl"}],"event":{"name":"the 2018 World Wide Web Conference","location":"Lyon, France","acronym":"WWW '18","number":"2018","sponsor":["SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web","IW3C2, International World Wide Web Conference Committee"],"start":{"date-parts":[[2018,4,23]]},"end":{"date-parts":[[2018,4,27]]}},"container-title":["Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178876.3186042","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3186042&ftid=1957396&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:27:00Z","timestamp":1750213620000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3178876.3186042"}},"subtitle":[],"proceedings-subject":"World Wide Web","short-title":[],"issued":{"date-parts":[[2018]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1145\/3178876.3186042","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}