{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:22:23Z","timestamp":1743070943487,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030649456"},{"type":"electronic","value":"9783030649463"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64946-3_4","type":"book-chapter","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:03:39Z","timestamp":1607159019000},"page":"45-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Ad Types Problem"],"prefix":"10.1007","author":[{"given":"Riccardo","family":"Colini-Baldeschi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juli\u00e1n","family":"Mestre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Okke","family":"Schrijvers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher A.","family":"Wilkens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,6]]},"reference":[{"key":"4_CR1","unstructured":"Abrams, Z., Ghosh, A., Vee, E.: Cost of conciseness in sponsored search auctions. In: Proceedings of 3rd WINE, pp. 326\u2013334, 2007"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Feldman, J., Muthukrishnan, S., Pal, M.: Sponsored search auctions with Markovian users. In: Proceedings of 4th WINE, pp. 621\u2013628 (2008)","DOI":"10.1007\/978-3-540-92185-1_68"},{"issue":"3","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1093\/qje\/qjr028","volume":"126","author":"S Athey","year":"2011","unstructured":"Athey, S., Ellison, G.: Position auctions with consumer search. Q. J. Econ. 126(3), 1213\u20131270 (2011)","journal-title":"Q. J. Econ."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Cavallo, R., Krishnamurthy, P., Sviridenko, M., Wilkens, C.A.: Sponsored search auctions with rich ads. In: Proceedings of the 26th WWW, pp. 43\u201351 (2017)","DOI":"10.1145\/3038912.3052703"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Cavallo, R., Sviridenko, M., Wilkens, C.A.: Matching auctions for search and native ads. In: Proceedings of the 19th EC, pp. 663\u2013680 (2018)","DOI":"10.1145\/3219166.3219191"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-319-13129-0_32","volume-title":"Web and Internet Economics","author":"R Cavallo","year":"2014","unstructured":"Cavallo, R., Wilkens, C.A.: GSP with general independent click-through-rates. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 400\u2013416. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13129-0_32"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Colini-Baldeschi, R., Mestre, J., Schrijvers, O., Wilkens, C.A.: The ad types problem. CoRR, abs\/1907.04400 (2019)","DOI":"10.1007\/978-3-030-64946-3_4"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-14553-7_4","volume-title":"Frontiers in Algorithmics","author":"X Deng","year":"2010","unstructured":"Deng, X., Sun, Y., Yin, M., Zhou, Y.: Mechanism design for multi-slot ads auction in sponsored search markets. In: Lee, D.-T., Chen, D.Z., Ying, S. (eds.) FAW 2010. LNCS, vol. 6213, pp. 11\u201322. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14553-7_4"},{"issue":"3","key":"4_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ipl.2012.11.006","volume":"113","author":"P D\u00fctting","year":"2013","unstructured":"D\u00fctting, P., Henzinger, M., Weber, I.: Sponsored search, market equilibria, and the Hungarian method. Inf. Process. Lett. 113(3), 67\u201373 (2013)","journal-title":"Inf. Process. Lett."},{"key":"4_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks, Crowds, and Markets","author":"D Easley","year":"2010","unstructured":"Easley, D., Kleinberg, J., et al.: Networks, Crowds, and Markets, vol. 8. Cambridge University Press, Cambridge (2010)"},{"issue":"1","key":"4_CR11","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.: Internet advertising and the generalized second-price auction: selling billions of dollars worth of keywords. Am. Econ. Rev. 97(1), 242\u2013259 (2007)","journal-title":"Am. Econ. Rev."},{"issue":"2","key":"4_CR12","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. J. ACM 19(2), 248\u2013264 (1972)","journal-title":"J. ACM"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Farina, G., Gatti, N.: Ad auctions and cascade model: GSP inefficiency and algorithms. In: Proceedings of the 13th AAAI, pp. 489\u2013495 (2016)","DOI":"10.1609\/aaai.v30i1.10035"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-24829-0_11","volume-title":"Algorithmic Game Theory","author":"D Fotakis","year":"2011","unstructured":"Fotakis, D., Krysta, P., Telelis, O.: Externalities among advertisers in sponsored search. In: Persiano, G. (ed.) SAGT 2011. LNCS, vol. 6982, pp. 105\u2013116. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24829-0_11"},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596\u2013615 (1987)","journal-title":"J. ACM"},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","volume":"30","author":"HN Gabow","year":"1985","unstructured":"Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. J. Comput. Syst. Sci. 30(2), 209\u2013221 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.tcs.2018.06.011","volume":"745","author":"N Gatti","year":"2018","unstructured":"Gatti, N., Rocco, M., Serafino, P., Ventre, C.: Towards better models of externalities in sponsored search auctions. Theor. Comput. Sci. 745, 150\u2013162 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Ghosh, A., Mahdian, M.: Externalities in online advertising. In: Proceedings of the 17th WINE, pp. 161\u2013168 (2008)","DOI":"10.1145\/1367497.1367520"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Ghosh, A., Sayedi, A.: Expressive auctions for externalities in online advertising. In: Proceedings of the 19th WINE, pp. 371\u2013380 (2010)","DOI":"10.1145\/1772690.1772729"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Giotis, I., Karlin, A.R.: On the equilibria and efficiency of the GSP mechanism in keyword auctions with externalities. In Proceedings of the 4th WINE, pp. 629\u2013638 (2008)","DOI":"10.1007\/978-3-540-92185-1_69"},{"issue":"3","key":"4_CR21","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/nav.3800140304","volume":"14","author":"F Glover","year":"1967","unstructured":"Glover, F.: Maximum matching in a convex bipartite graph. Nav. Res. Logist. Q. 14(3), 313\u2013316 (1967)","journal-title":"Nav. Res. Logist. Q."},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-642-10841-9_17","volume-title":"Internet and Network Economics","author":"R Gomes","year":"2009","unstructured":"Gomes, R., Immorlica, N., Markakis, E.: Externalities in keyword auctions: an empirical and theoretical assessment. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 172\u2013183. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10841-9_17"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Hartline, J., Immorlica, N., Khani, M.R., Lucier, B., Niazadeh, R.: Fast core pricing for rich advertising auctions. In: Proceedings of the 19th EC, pp. 111\u2013112 (2018)","DOI":"10.1145\/3219166.3219231"},{"key":"4_CR24","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.ijindorg.2015.12.002","volume":"45","author":"P Hummel","year":"2016","unstructured":"Hummel, P.: Position auctions with dynamic resizing. Int. J. Ind. Organ. 45, 38\u201346 (2016)","journal-title":"Int. J. Ind. Organ."},{"issue":"2","key":"4_CR25","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1287\/ijoc.1070.0232","volume":"20","author":"I Katriel","year":"2008","unstructured":"Katriel, I.: Matchings in node-weighted convex bipartite graphs. INFORMS J. Comput. 20(2), 205\u2013211 (2008)","journal-title":"INFORMS J. Comput."},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-540-92185-1_65","volume-title":"Internet and Network Economics","author":"D Kempe","year":"2008","unstructured":"Kempe, D., Mahdian, M.: A cascade model for externalities in sponsored search. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 585\u2013596. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92185-1_65"},{"key":"4_CR27","unstructured":"Kern, W., Manthey, B., Uetz, M.: Note on VCG vs. price raising for matching markets. CoRR, abs\/1604.04157 (2016)"},{"issue":"1\u20132","key":"4_CR28","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Nav. Res. Logist. Q. 2(1\u20132), 83\u201397 (1955)","journal-title":"Nav. Res. Logist. Q."},{"issue":"4","key":"4_CR29","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF00264533","volume":"15","author":"W Lipski","year":"1981","unstructured":"Lipski, W., Preparata, F.P.: Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems. Acta Informatica 15(4), 329\u2013346 (1981)","journal-title":"Acta Informatica"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Mahdian, M., Schrijvers, O., Vassilvitskii, S.: Algorithmic cartography: placing points of interest and ads on maps. In: Proceedings of the 21st KDD, pp. 755\u2013764 (2015)","DOI":"10.1145\/2783258.2783375"},{"issue":"1","key":"4_CR31","first-page":"32","volume":"5","author":"J Munkres","year":"1957","unstructured":"Munkres, J.: Algorithms for the assignment and transportation problems. J. SIAM 5(1), 32\u201338 (1957)","journal-title":"J. SIAM"},{"key":"4_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-02882-3_1","volume-title":"Computing and Combinatorics","author":"S Muthukrishnan","year":"2009","unstructured":"Muthukrishnan, S.: Bidding on configurations in internet ad auctions. In: Ngo, H.Q. (ed.) COCOON 2009. LNCS, vol. 5609, pp. 1\u20136. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02882-3_1"},{"issue":"1","key":"4_CR33","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"RB Myerson","year":"1981","unstructured":"Myerson, R.B.: Optimal auction design. Math. Oper. Res. 6(1), 58\u201373 (1981)","journal-title":"Math. Oper. Res."},{"key":"4_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-540-70575-8_19","volume-title":"Automata, Languages and Programming","author":"CG Plaxton","year":"2008","unstructured":"Plaxton, C.G.: Fast scheduling of weighted unit jobs with release times and deadlines. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5125, pp. 222\u2013233. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70575-8_19"},{"key":"4_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-642-45030-3_49","volume-title":"Algorithms and Computation","author":"CG Plaxton","year":"2013","unstructured":"Plaxton, C.G.: Vertex-weighted matching in two-directional orthogonal ray graphs. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) ISAAC 2013. LNCS, vol. 8283, pp. 524\u2013534. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45030-3_49"},{"key":"4_CR36","unstructured":"Ramshaw, L., Tarjan, R.E.: On minimum-cost assignments in unbalanced bipartite graphs. HP Labs, Palo Alto, CA, USA, Technical report, HPL-2012-40R1 (2012)"},{"key":"4_CR37","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Revenue-maximizing auctions. In: Twenty Lectures on Algorithmic Game Theory (2016)","DOI":"10.1017\/CBO9781316779309"},{"key":"4_CR38","doi-asserted-by":"crossref","unstructured":"Sharathkumar, R., Agarwal, P.K.: Algorithms for the transportation problem in geometric settings. In: Proceedings of the 23rd SODA, pp. 306\u2013317 (2012)","DOI":"10.1137\/1.9781611973099.29"},{"issue":"6","key":"4_CR39","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1016\/j.ijindorg.2006.10.002","volume":"25","author":"HR Varian","year":"2007","unstructured":"Varian, H.R.: Position auctions. Int. J. Ind. Organ. 25(6), 1163\u20131178 (2007)","journal-title":"Int. J. Ind. Organ."}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64946-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,14]],"date-time":"2023-10-14T17:19:02Z","timestamp":1697303942000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64946-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030649456","9783030649463"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64946-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/econcs.pku.edu.cn\/wine2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"136","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}