{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T07:40:18Z","timestamp":1743666018151,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642321467"},{"type":"electronic","value":"9783642321474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32147-4_39","type":"book-chapter","created":{"date-parts":[[2012,7,5]],"date-time":"2012-07-05T11:54:50Z","timestamp":1341489290000},"page":"439-450","source":"Crossref","is-referenced-by-count":0,"title":["Second-Price Ad Auctions with Binary Bids and Markets with Good Competition"],"prefix":"10.1007","author":[{"given":"Cristina G.","family":"Fernandes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael C. S.","family":"Schouery","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-04128-0_14","volume-title":"Algorithms - ESA 2009","author":"Y. Azar","year":"2009","unstructured":"Azar, Y., Birnbaum, B., Karlin, A.R., Nguyen, C.T.: On Revenue Maximization in Second-Price Ad Auctions. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 155\u2013166. Springer, Heidelberg (2009)"},{"key":"39_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-75520-3_24","volume-title":"Algorithms \u2013 ESA 2007","author":"N. Buchbinder","year":"2007","unstructured":"Buchbinder, N., Jain, K., Naor, J.: Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 253\u2013264. Springer, Heidelberg (2007)"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Goel, G.: On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and gap. In: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 687\u2013696 (2008)","DOI":"10.1109\/FOCS.2008.47"},{"key":"39_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/1566374.1566384","volume-title":"Proceedings of the 10th ACM Conference on Electronic Commerce","author":"N.R. Devanur","year":"2009","unstructured":"Devanur, N.R., Hayes, T.P.: The adwords problem: online keyword matching with budgeted bidders under random permutations. In: Proceedings of the 10th ACM Conference on Electronic Commerce, pp. 71\u201378. ACM, New York (2009)"},{"key":"39_CR5","unstructured":"Econsultancy: State of Search Engine Marketing Report (2010), with SEMPO, http:\/\/www.sempo.org\/resource\/resmgr\/Docs\/State-of-Search-Engine-Marke.pdf"},{"issue":"1","key":"39_CR6","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1257\/aer.97.1.242","volume":"97","author":"B. Edelman","year":"2007","unstructured":"Edelman, B., Ostrovsky, M., Schwarz, M., Fudenberg, T.D., Kaplow, L., Lee, R., Milgrom, P., Niederle, M., Pakes, A.: Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords. American Economic Review\u00a097(1), 242\u2013259 (2007)","journal-title":"American Economic Review"},{"key":"39_CR7","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the Association for Computing Machinery\u00a019, 248\u2013264 (1972)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"39_CR8","unstructured":"Goel, A., Mahdian, M., Nazerzadeh, H., Saberi, A.: Advertisement allocation for generalized second pricing schemes. In: Fourth Workshop on Ad Auctions (2008)"},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"Lahaie, S., Pennock, D.M., Saberi, A., Vohra, R.V.: Sponsored search auctions. In: Nisam, N., Roughgarden, T., Tardos, E., Vazirani, V. (eds.) Algorithmic Game Theory, pp. 699\u2013716. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481.030"},{"issue":"2","key":"39_CR10","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.geb.2005.02.006","volume":"55","author":"B. Lehmann","year":"2006","unstructured":"Lehmann, B., Lehmann, D., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. Games and Economic Behavior\u00a055(2), 270\u2013296 (2006)","journal-title":"Games and Economic Behavior"},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized on-line matching. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 264\u2013273 (2005)","DOI":"10.1109\/SFCS.2005.12"},{"key":"39_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-540-85363-3_20","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"A. Srinivasan","year":"2008","unstructured":"Srinivasan, A.: Budgeted Allocations in the Full-Information Setting. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX and RANDOM 2008. LNCS, vol.\u00a05171, pp. 247\u2013253. Springer, Heidelberg (2008)"},{"issue":"6","key":"39_CR13","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1016\/j.ijindorg.2006.10.002","volume":"25","author":"H.R. Varian","year":"2007","unstructured":"Varian, H.R.: Position auctions. International Journal of Industrial Organization\u00a025(6), 1163\u20131178 (2007)","journal-title":"International Journal of Industrial Organization"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32147-4_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T07:20:12Z","timestamp":1743664812000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32147-4_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642321467","9783642321474"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32147-4_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}