{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T12:33:12Z","timestamp":1790512392285,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,4,16]],"date-time":"2012-04-16T00:00:00Z","timestamp":1334534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,4,16]]},"DOI":"10.1145\/2187836.2187888","type":"proceedings-article","created":{"date-parts":[[2012,4,24]],"date-time":"2012-04-24T14:41:27Z","timestamp":1335278487000},"page":"381-388","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":48,"title":["Optimizing budget allocation among channels and influencers"],"prefix":"10.1145","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[{"name":"Tel Aviv University and Microsoft Research, Tel Aviv, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Iftah","family":"Gamzu","sequence":"additional","affiliation":[{"name":"Tel Aviv University and Microsoft Research, Tel Aviv, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moshe","family":"Tennenholtz","sequence":"additional","affiliation":[{"name":"Microsoft Research and Technion, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2012,4,16]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Manuscript","author":"Alon N.","year":"2011","unstructured":"N. Alon , S. Arora , R. Manokaran , D. Moshkovitz , and O. Weinstein . On the inapproximability of the densest k-subgraph problem . Manuscript , 2011 . N. Alon, S. Arora, R. Manokaran, D. Moshkovitz, and O. Weinstein. On the inapproximability of the densest k-subgraph problem. Manuscript, 2011."},{"key":"e_1_3_2_1_2_1","volume-title":"In6th Workshop on Ad Auctions","author":"Archak N.","year":"2010","unstructured":"N. Archak , V. Mirrokni , and M. Muthukrishnan . Budget optimization for online advertising campaigns with carryover effects . In6th Workshop on Ad Auctions , 2010 . N. Archak, V. Mirrokni, and M. Muthukrishnan. Budget optimization for online advertising campaigns with carryover effects. In6th Workshop on Ad Auctions, 2010."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1781894.1781932"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806719"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806743"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064009.1064014"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133090"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.39"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502525"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509985"},{"key":"e_1_3_2_1_12_1","volume-title":"Department of Computer Science and Applied Math.","author":"Feige U.","year":"2004","unstructured":"U. Feige and S. Kogan . Hardness of approximation of the balanced complete bipartite subgraph problem. Technical report , Department of Computer Science and Applied Math. , Weizmann Institute , 2004 . U. Feige and S. Kogan. Hardness of approximation of the balanced complete bipartite subgraph problem. Technical report, Department of Computer Science and Applied Math., Weizmann Institute, 2004."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010050"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250917"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1086\/226707"},{"key":"e_1_3_2_1_16_1","volume-title":"Approximation algorithms for NP-hard problems","author":"Hochbaum D. S.","year":"1997","unstructured":"D. S. Hochbaum , editor. Approximation algorithms for NP-hard problems . PWS Publishing Co. , 1997 . D. S. Hochbaum, editor. Approximation algorithms for NP-hard problems. PWS Publishing Co., 1997."},{"key":"e_1_3_2_1_17_1","first-page":"69","article-title":"Diffusion on social networks","volume":"16","author":"Jackson M.","year":"2005","unstructured":"M. Jackson and L. Yariv . Diffusion on social networks . Economie Publique , 16 : 69 -- 82 , 2005 . M. Jackson and L. Yariv. Diffusion on social networks. Economie Publique, 16:69--82, 2005.","journal-title":"Economie Publique"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_91"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447037"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481.026"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-937X.00121"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250811"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.3.3.177"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_3_2_1_26_1","volume-title":"Norton","author":"Schelling T.","year":"1978","unstructured":"T. Schelling . Micromotives and Macrobehavior . Norton , 1978 . T. Schelling. Micromotives and Macrobehavior. Norton, 1978."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-1817-8_4"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(97)00028-3"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.78"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(03)00062-2"},{"key":"e_1_3_2_1_31_1","volume-title":"An Evolutionary Theory of Institutions","author":"Young H. P.","year":"1998","unstructured":"H. P. Young . Individual Strategy and Social Structure : An Evolutionary Theory of Institutions . Princeton University Press , 1998 . H. P. Young. Individual Strategy and Social Structure: An Evolutionary Theory of Institutions. Princeton University Press, 1998."}],"event":{"name":"WWW 2012: 21st World Wide Web Conference 2012","location":"Lyon France","acronym":"WWW 2012","sponsor":["Univ. de Lyon Universite de Lyon","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the 21st international conference on World Wide Web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2187836.2187888","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2187836.2187888","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:06:34Z","timestamp":1750226794000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2187836.2187888"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,16]]},"references-count":31,"alternative-id":["10.1145\/2187836.2187888","10.1145\/2187836"],"URL":"https:\/\/doi.org\/10.1145\/2187836.2187888","relation":{},"subject":[],"published":{"date-parts":[[2012,4,16]]},"assertion":[{"value":"2012-04-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}