{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:36:26Z","timestamp":1750221386961,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":22,"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\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3178876.3186047","type":"proceedings-article","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T15:53:48Z","timestamp":1523634828000},"page":"1419-1428","source":"Crossref","is-referenced-by-count":7,"title":["Testing Incentive Compatibility in Display Ad Auctions"],"prefix":"10.1145","author":[{"given":"S\u00e9bastien","family":"Lahaie","sequence":"first","affiliation":[{"name":"Google Research, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9s","family":"Munoz Medina","sequence":"additional","affiliation":[{"name":"Google Research, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Balasubramanian","family":"Sivan","sequence":"additional","affiliation":[{"name":"Google Research, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergei","family":"Vassilvitskii","sequence":"additional","affiliation":[{"name":"Google Research, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/3178876.3186047-1","unstructured":"Kareem Amin, Afshin Rostamizadeh, and Umar Syed. Learning prices for repeated auctions with strategic buyers. In Proceedings of NIPS, pages 1169--1177, 2013."},{"key":"key-10.1145\/3178876.3186047-2","doi-asserted-by":"crossref","unstructured":"Itai Ashlagi, Constantinos Daskalakis, and Nima Haghpanah. Sequential mechanisms with ex-post participation guarantees. In Proceedings of the 2016 ACM Conference on Economics and Computation, EC '16, pages 213--214, New York, NY, USA, 2016. ACM.","DOI":"10.1145\/2940716.2940775"},{"key":"key-10.1145\/3178876.3186047-3","doi-asserted-by":"crossref","unstructured":"Santiago Balseiro, Vahab Mirrokni, and Renato Paes Leme. Dynamic mechanisms with martingale utilities. In Proceedings of the 2017 ACM Conference on Economics and Computation, EC '17, pages 165--165, New York, NY, USA, 2017. ACM.","DOI":"10.1145\/3033274.3084089"},{"key":"key-10.1145\/3178876.3186047-4","unstructured":"Ross Benes. How SSPs use deceptive price floors to squeeze ad buyers. https:\/\/digiday.com\/marketing\/ssps-use-deceptive-price-floors-squeeze-ad-buyers, September 30, 2017. Accessed: 2017--10--20."},{"key":"key-10.1145\/3178876.3186047-5","doi-asserted-by":"crossref","unstructured":"Shuchi Chawla, Jason D. Hartline, David L. Malec, and Balasubramanian Sivan. Multi-parameter mechanism design and sequential posted pricing. In Proceedings of the Forty-second ACM Symposium on Theory of Computing, STOC '10, pages 311--320, New York, NY, USA, 2010. ACM.","DOI":"10.1145\/1806689.1806733"},{"key":"key-10.1145\/3178876.3186047-6","doi-asserted-by":"crossref","unstructured":"Shuchi Chawla, David L. Malec, and Balasubramanian Sivan. The power of randomness in bayesian optimal mechanism design. In Proceedings of the 11th ACM Conference on Electronic Commerce, EC '10, pages 149--158, New York, NY, USA, 2010. ACM.","DOI":"10.1145\/1807342.1807366"},{"key":"key-10.1145\/3178876.3186047-7","doi-asserted-by":"crossref","unstructured":"Richard Cole and Tim Roughgarden. The sample complexity of revenue maximization. In Proceedings of the Forty-sixth Annual ACM Symposium on Theory of Computing, STOC '14, pages 243--252, New York, NY, USA, 2014. ACM.","DOI":"10.1145\/2591796.2591867"},{"key":"key-10.1145\/3178876.3186047-8","doi-asserted-by":"crossref","unstructured":"Nikhil R. Devanur, Yuval Peres, and Balasubramanian Sivan. Perfect bayesian equilibria in repeated sales. In Proceedings of the Twenty-sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '15, pages 983--1002, Philadelphia, PA, USA, 2015. Society for Industrial and Applied Mathematics.","DOI":"10.1137\/1.9781611973730.67"},{"key":"key-10.1145\/3178876.3186047-9","doi-asserted-by":"crossref","unstructured":"Peerapong Dhangwatnotai, Tim Roughgarden, and Qiqi Yan. Revenue maximization with a single sample. Games and Economic Behavior, 91(C):318--333, 2015.","DOI":"10.1016\/j.geb.2014.03.011"},{"key":"key-10.1145\/3178876.3186047-10","doi-asserted-by":"crossref","unstructured":"Alexey Drutsa. Horizon-independent optimal pricing in repeated auctions with truthful and strategic buyers. In Proceedings of WWW, pages 33--42, 2017.","DOI":"10.1145\/3038912.3052700"},{"key":"key-10.1145\/3178876.3186047-11","doi-asserted-by":"crossref","unstructured":"Jason D. Hartline and Tim Roughgarden. Simple versus optimal mechanisms. In Proceedings of the 10th ACM Conference on Electronic Commerce, EC '09, pages 225--234, New York, NY, USA, 2009. ACM.","DOI":"10.1145\/1566374.1566407"},{"key":"key-10.1145\/3178876.3186047-12","doi-asserted-by":"crossref","unstructured":"Zhiyi Huang, Yishay Mansour, and Tim Roughgarden. Making the most of your samples. In Proceedings of the Sixteenth ACM Conference on Economics and Computation, EC '15, pages 45--60, New York, NY, USA, 2015. ACM.","DOI":"10.1145\/2764468.2764475"},{"key":"key-10.1145\/3178876.3186047-13","doi-asserted-by":"crossref","unstructured":"Yash Kanoria and Hamid Nazerzadeh. Dynamic reserve prices for repeated auctions: Learning from bids - working paper. In Proceedings of WINE, page 232, 2014.","DOI":"10.1007\/978-3-319-13129-0_17"},{"key":"key-10.1145\/3178876.3186047-14","unstructured":"Vahab Mirrokni, Renato Paes Leme, Pingzhong Tang, and Song Zuo. Dynamic auctions with bank accounts. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI'16, pages 387--393, 2016."},{"key":"key-10.1145\/3178876.3186047-15","unstructured":"Mehryar Mohri and Andres Mu noz Medina. Revenue optimization against strategic buyers. In Proceedings of NIPS, pages 2530--2538, 2015."},{"key":"key-10.1145\/3178876.3186047-16","unstructured":"Jamie Morgenstern and Tim Roughgarden. The pseudo-dimension of near-optimal auctions. In Proceedings of the 28th International Conference on Neural Information Processing Systems - Volume 1, NIPS'15, pages 136--144, Cambridge, MA, USA, 2015. MIT Press."},{"key":"key-10.1145\/3178876.3186047-17","doi-asserted-by":"crossref","unstructured":"Roger B. Myerson. Optimal auction design. Math. Oper. Res., 6(1):58--73, February 1981.","DOI":"10.1287\/moor.6.1.58"},{"key":"key-10.1145\/3178876.3186047-18","doi-asserted-by":"crossref","unstructured":"Renato Paes Leme, Martin Pal, and Sergei Vassilvitskii. A field guide to personalized reserve prices. In Proceedings of the 25th International Conference on World Wide Web, WWW '16, pages 1093--1102, Republic and Canton of Geneva, Switzerland, 2016. International World Wide Web Conferences Steering Committee.","DOI":"10.1145\/2872427.2883071"},{"key":"key-10.1145\/3178876.3186047-19","doi-asserted-by":"crossref","unstructured":"D. C. Parkes, M. O. Rabin, S. M. Shieber, and C. A. Thorpe. Practical secrecy-preserving, verifiably correct and trustworthy auctions. In Proceedings of the 8th International Conference on Electronic Commerce: The New e-Commerce: Innovations for Conquering Current Barriers, Obstacles and Limitations to Conducting Successful Business on the Internet, ICEC '06, pages 70--81, New York, NY, USA, 2006. ACM.","DOI":"10.1145\/1151454.1151478"},{"key":"key-10.1145\/3178876.3186047-20","doi-asserted-by":"crossref","unstructured":"Tim Roughgarden and Joshua R. Wang. Minimizing regret with multiple reserves. In Proceedings of the 2016 ACM Conference on Economics and Computation, EC '16, pages 601--616, New York, NY, USA, 2016. ACM.","DOI":"10.1145\/2940716.2940792"},{"key":"key-10.1145\/3178876.3186047-21","unstructured":"Sarah Sluis. Big changes coming to auctions, as exchanges roll the dice on first-price. https:\/\/adexchanger.com\/platforms\/big-changes-coming-auctions-exchanges-roll-dice-first-price, May 5, 2017. Accessed: 2017--10--20."},{"key":"key-10.1145\/3178876.3186047-22","doi-asserted-by":"crossref","unstructured":"Qiqi Yan. Mechanism design via correlation gap. In Proceedings of the Twenty-second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '11, pages 710--719, Philadelphia, PA, USA, 2011. Society for Industrial and Applied Mathematics.","DOI":"10.1137\/1.9781611973082.56"}],"event":{"number":"2018","sponsor":["SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web","IW3C2, International World Wide Web Conference Committee"],"acronym":"WWW '18","name":"the 2018 World Wide Web Conference","start":{"date-parts":[[2018,4,23]]},"location":"Lyon, France","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.3186047","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3186047&ftid=1957425&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.3186047"}},"subtitle":[],"proceedings-subject":"World Wide Web","short-title":[],"issued":{"date-parts":[[2018]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1145\/3178876.3186047","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}