{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T16:56:04Z","timestamp":1758819364989,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030054137"},{"type":"electronic","value":"9783030054144"}],"license":[{"start":{"date-parts":[[2018,12,5]],"date-time":"2018-12-05T00:00:00Z","timestamp":1543968000000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-05414-4_16","type":"book-chapter","created":{"date-parts":[[2018,12,4]],"date-time":"2018-12-04T17:32:48Z","timestamp":1543944768000},"page":"197-210","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Advertisement Allocation and Mechanism Design in Native Stream Advertising"],"prefix":"10.1007","author":[{"given":"Iftah","family":"Gamzu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iordanis","family":"Koutsopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,5]]},"reference":[{"key":"16_CR1","unstructured":"Business Insider. Native ads will drive $$74\\%$$ of all ad revenue by 2021 (2016). \nhttp:\/\/www.businessinsider.com\/the-native-ad-report-forecasts-2016-5"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Lahaie, S., Pennock, D.M., Saberi, A., Vohra, R.V.: Sponsored search auctions. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (eds.) Algorithmic Game Theory, chapter 28. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481.030"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Ghosh, A., Mahdian, M.: Externalities in online advertising. In: 17th WWW, pp. 161\u2013168 (2008)","DOI":"10.1145\/1367497.1367520"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Kempe, D., Mahdian, M.: A cascade model for externalities in sponsored search. In: 4th WINE, pp. 585\u2013596 (2008)","DOI":"10.1007\/978-3-540-92185-1_65"},{"key":"16_CR5","doi-asserted-by":"crossref","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. Naval Res. Logist. Q. 2, 83\u201397 (1955)","journal-title":"Naval Res. Logist. Q."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Koutsopoulos, I.: Optimal advertisement allocation in online social media feeds. In: 8th HotPOST, pp. 43\u201348 (2016)","DOI":"10.1145\/2944789.2944791"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Koutsopoulos, I., Spentzouris, P.: Native advertisement selection and allocation in social media post feeds. In: ECML PKDD, pp. 588\u2013603 (2016)","DOI":"10.1007\/978-3-319-46128-1_37"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Ieong, S., Mahdian, M., Vassilvitskii, S.: Advertising in a stream. In: 23rd WWW, pp. 29\u201338 (2014)","DOI":"10.1145\/2566486.2568030"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Lalmas, M., Lehmann, J., Shaked, G., Silvestri, F., Tolomei, G.: Promoting positive post-click experience for in-stream yahoo gemini users. In: 21th SIGKDD, pp. 1929\u20131938 (2015)","DOI":"10.1145\/2783258.2788581"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Barbieri, N., Silvestri, F., Lalmas, M.: Improving post-click user engagement on native ads via survival analysis. In: 25th WWW, pp. 761\u2013770 (2016)","DOI":"10.1145\/2872427.2883092"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Zhou, K., Redi, M., Haines, A., Lalmas, M.: Predicting pre-click quality for native advertisements. In: 25th WWW, pp. 299\u2013310 (2016)","DOI":"10.1145\/2872427.2883053"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Goel, A., Motwani, R.: Truthful auctions for pricing search keywords. In: 7th EC, pp. 1\u20137 (2006)","DOI":"10.1145\/1134707.1134708"},{"issue":"5","key":"16_CR13","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<215::AID-JOS27>3.0.CO;2-Y","volume":"2","author":"FCR Spieksma","year":"1999","unstructured":"Spieksma, F.C.R.: On the approximability of an interval scheduling problem. J. Sched. 2(5), 215\u2013227 (1999)","journal-title":"J. Sched."},{"issue":"2","key":"16_CR14","first-page":"331352","volume":"31","author":"A Bar-Noy","year":"2001","unstructured":"Bar-Noy, A., Guha, S., Naor, J., Schieber, B.: Approximating the throughput of multiple machines in real-time scheduling. SIAM J. Comput. 31(2), 331352 (2001)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"16_CR15","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1145\/502102.502107","volume":"48","author":"A Bar-Noy","year":"2001","unstructured":"Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Schieber, B.: A unified approach to approximating resource allocation and scheduling. J. ACM 48(5), 1069\u20131090 (2001)","journal-title":"J. ACM"},{"issue":"1","key":"16_CR16","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0196-6774(02)00291-2","volume":"46","author":"T Erlebach","year":"2003","unstructured":"Erlebach, T., Spieksma, F.C.R.: Interval selection: applications, algorithms, and lower bounds. J. Algorithms 46(1), 27\u201353 (2003)","journal-title":"J. Algorithms"},{"key":"16_CR17","unstructured":"Gamzu, I., Koutsopoulos, I.: Native Advertising via Interval Scheduling. \nhttps:\/\/www.dropbox.com\/s\/slaog50kf0w8ty0\/TR-2018-extended.pdf?dl=0"},{"issue":"4","key":"16_CR18","doi-asserted-by":"crossref","first-page":"617","DOI":"10.2307\/1914085","volume":"41","author":"T Groves","year":"1973","unstructured":"Groves, T.: Incentives in teams. Econemetrica 41(4), 617\u2013631 (1973)","journal-title":"Econemetrica"},{"key":"16_CR19","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1613\/jair.2046","volume":"29","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Ronen, A.: Computationally feasible vcg mechanisms. JAIR 29, 19\u201347 (2007)","journal-title":"JAIR"},{"issue":"1","key":"16_CR20","doi-asserted-by":"crossref","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":"16_CR21","doi-asserted-by":"crossref","unstructured":"Azar, Y., Gamzu, I.: Truthful unification framework for packing integer programs with choices. In: 35th ICALP, pp. 833\u2013844 (2008)","DOI":"10.1007\/978-3-540-70575-8_68"},{"issue":"6","key":"16_CR22","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/2049697.2049699","volume":"58","author":"R Lavi","year":"2011","unstructured":"Lavi, R., Swamy, C.: Truthful and near-optimal mechanism design via linear programming. J. ACM 58(6), 25 (2011)","journal-title":"J. ACM"},{"issue":"1\u20132","key":"16_CR23","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N Nisan","year":"2001","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. Games Econ. Behav. 35(1\u20132), 166\u2013196 (2001)","journal-title":"Games Econ. Behav."}],"container-title":["Studies in Computational Intelligence","Complex Networks and Their Applications VII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05414-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,12,8]],"date-time":"2018-12-08T01:14:26Z","timestamp":1544231666000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05414-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,5]]},"ISBN":["9783030054137","9783030054144"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05414-4_16","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2018,12,5]]},"assertion":[{"value":"COMPLEX NETWORKS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cambridge","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}