{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T12:10:36Z","timestamp":1764936636559},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642339950"},{"type":"electronic","value":"9783642339967"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33996-7_15","type":"book-chapter","created":{"date-parts":[[2012,10,6]],"date-time":"2012-10-06T07:27:01Z","timestamp":1349508421000},"page":"168-179","source":"Crossref","is-referenced-by-count":15,"title":["Ad Auctions with Data"],"prefix":"10.1007","author":[{"given":"Hu","family":"Fu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Jordan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Mahdian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uri","family":"Nadav","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Inbal","family":"Talgam-Cohen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergei","family":"Vassilvitskii","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Abraham, I., Athey, S., Babaioff, M., Grubb, M.: Peaches, lemons, and cookies: Designing auction markets with dispersed information (2011) (manuscript)"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Feldman, M., Gamzu, I., Tennenholtz, M.: The asymmetric matrix partition problem (manuscript, 2012)","DOI":"10.1007\/978-3-642-45046-4_1"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Kleinberg, R., Leme, R.P.: Optimal mechanisms for selling information. In: ACM Conference on Electronic Commerce, pp. 92\u2013109 (2012)","DOI":"10.1145\/2229012.2229024"},{"key":"15_CR4","unstructured":"Beck, M., Milgrom, P.: Auctions, adverse selection and internet display advertising. Working paper (2011)"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s00199-006-0177-4","volume":"38","author":"S. Board","year":"2009","unstructured":"Board, S.: Revealing information in auctions: the allocation effect. Econ. Theory\u00a038, 125\u2013135 (2009)","journal-title":"Econ. Theory"},{"issue":"5","key":"15_CR6","doi-asserted-by":"publisher","first-page":"1060","DOI":"10.1086\/261643","volume":"97","author":"J. Bulow","year":"1989","unstructured":"Bulow, J., Roberts, J.: The simple economics of optimal auctions. The Journal of Political Economy\u00a097(5), 1060\u20131090 (1989)","journal-title":"The Journal of Political Economy"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Celis, L.E., Lewis, G., Mobius, M., Nazerzadeh, H.: Buy-it-now or take-a-chance: A simple sequential screening mechanism. In: WWW (2011)","DOI":"10.1145\/1963405.1963429"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Dwork, C., Hardt, M., Pitassi, T., Reingold, O., Zemel, R.: Fairness through awareness. In: ITCS (2012)","DOI":"10.1145\/2090236.2090255"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Emek, Y., Feldman, M., Gamzu, I., Leme, R.P., Tennenholtz, M.: Signaling schemes for revenue maximization. In: ACM Conf. on Electronic Commerce (2012)","DOI":"10.1145\/2229012.2229051"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Ghosh, A., Mahdian, M., McAfee, R.P., Vassilvitskii, S.: To match or not to match: Economics of cookie matching in online advertising. In: ACM Conference on Electronic Commerce (2012)","DOI":"10.1145\/2229012.2229069"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Hartline, J.D., Karlin, A.R.: Profit maximization in mechanism design. In: Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.V. (eds.) Algorithmic Game Theory, ch. 13. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481.015"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Hartline, J.D., Roughgarden, T.: Simple versus optimal mechanisms. In: ACM Conference on Electronic Commerce, pp. 225\u2013234 (2009)","DOI":"10.1145\/1566374.1566407"},{"issue":"2","key":"15_CR13","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1257\/aer.100.2.603","volume":"100","author":"J. Levin","year":"2010","unstructured":"Levin, J., Milgrom, P.: Online advertising: Heterogeneity and conflation in market design. American Economic Review\u00a0100(2), 603\u2013607 (2010)","journal-title":"American Economic Review"},{"key":"15_CR14","unstructured":"McAfee, R.P.: When does improved targeting increase revenue? Working paper, private communication (2012)"},{"issue":"5","key":"15_CR15","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.2307\/1911865","volume":"50","author":"P. Milgrom","year":"1982","unstructured":"Milgrom, P., Weber, R.J.: A theory of auctions and competitive bidding. Econometrica\u00a050(5), 1089\u20131122 (1982)","journal-title":"Econometrica"},{"key":"15_CR16","unstructured":"Miltersen, P.B., Sheffet, O.: Send mixed signals \u2014 earn more, work less. In: ACM Conference on Electronic Commerce (2012)"},{"issue":"1","key":"15_CR17","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"R. Myerson","year":"1981","unstructured":"Myerson, R.: Optimal auction design. Mathematics of Operations Research\u00a06(1), 58\u201373 (1981)","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"15_CR18","doi-asserted-by":"publisher","first-page":"463","DOI":"10.2307\/1912001","volume":"51","author":"T.R. Palfrey","year":"1983","unstructured":"Palfrey, T.R.: Bundling decisions by a multiproduct monopolist with incomplete information. Econometrica\u00a051(2), 463\u2013483 (1983)","journal-title":"Econometrica"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33996-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T03:05:03Z","timestamp":1687748703000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33996-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642339950","9783642339967"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33996-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}