{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:50:26Z","timestamp":1742914226528,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030299071"},{"type":"electronic","value":"9783030299088"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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-29908-8_45","type":"book-chapter","created":{"date-parts":[[2019,8,23]],"date-time":"2019-08-23T01:03:32Z","timestamp":1566522212000},"page":"568-582","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising"],"prefix":"10.1007","author":[{"given":"Daisuke","family":"Hatano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuko","family":"Kuroki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasushi","family":"Kawase","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanna","family":"Sumita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naonori","family":"Kakimura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ken-ichi","family":"Kawarabayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,23]]},"reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Gamzu, I., Tennenholtz, M.: Optimizing budget allocation among channels and influencers. In: Proceedings of the 21st World Wide Web Conference 2012, WWW 2012, pp. 381\u2013388 (2012)","DOI":"10.1145\/2187836.2187888"},{"issue":"1","key":"45_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.4086\/toc.2012.v008a006","volume":"8","author":"S Arora","year":"2012","unstructured":"Arora, S., Hazan, E., Kale, S.: The multiplicative weights update method: a meta-algorithm and applications. Theor. Comput. 8(1), 121\u2013164 (2012)","journal-title":"Theor. Comput."},{"issue":"8","key":"45_CR3","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","volume":"23","author":"G Cornuejols","year":"1977","unstructured":"Cornuejols, G., Fisher, M.L., Nemhauser, G.L.: Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Manag. Sci. 23(8), 789\u2013810 (1977)","journal-title":"Manag. Sci."},{"issue":"4","key":"45_CR4","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln $$n$$ for approximating set cover. J. ACM 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"issue":"4","key":"45_CR5","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/2827872","volume":"5","author":"M Harper","year":"2015","unstructured":"Harper, M., Konstan, J.: The movielens datasets: history and context. ACM Trans. Interact. Intell. Syst. 5(4), 19 (2015). https:\/\/doi.org\/10.1145\/2827872","journal-title":"ACM Trans. Interact. Intell. Syst."},{"key":"45_CR6","doi-asserted-by":"crossref","unstructured":"Hatano, D., Fukunaga, T., Maehara, T., Kawarabayashi, K.: Lagrangian decomposition algorithm for allocating marketing channels. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015, pp. 1144\u20131150 (2015)","DOI":"10.1609\/aaai.v29i1.9358"},{"volume-title":"Approximation Algorithms for NP-hard Problems","year":"1997","key":"45_CR7","unstructured":"Hochbaum, D.S. (ed.): Approximation Algorithms for NP-hard Problems. PWS Publishing Co., Boston (1997)"},{"key":"45_CR8","doi-asserted-by":"crossref","unstructured":"Kawase, Y., Sumita, H.: Randomized strategies for robust combinatorial optimization. In: Proceedings of the 33rd AAAI Conference on Artificial Intelligence AAAI 2019 (2019)","DOI":"10.1609\/aaai.v33i01.33017876"},{"key":"45_CR9","doi-asserted-by":"crossref","unstructured":"Krause, A., Golovin, D.: Submodular function maximization. In: Tractability: Practical Approaches to Hard Problems, pp. 71\u2013104 (2014)","DOI":"10.1017\/CBO9781139177801.004"},{"key":"45_CR10","unstructured":"Maehara, T., Yabe, A., Kawarabayashi, K.: Budget allocation problem with multiple advertisers: a game theoretic view. In: Proceedings of the 32nd International Conference on Machine Learning, ICML 2015, pp. 428\u2013437 (2015)"},{"key":"45_CR11","unstructured":"Miyauchi, A., Iwamasa, Y., Fukunaga, T., Kakimura, N.: Threshold influence model for allocating advertising budgets. In: Proceedings of the 32nd International Conference on Machine Learning, ICML 2015, pp. 1395\u20131404 (2015)"},{"issue":"1","key":"45_CR12","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions - I. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"issue":"5","key":"45_CR13","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/BF00935665","volume":"11","author":"MA Simaan","year":"1973","unstructured":"Simaan, M.A., Cruz, J.B.: On the stackelberg strategy in nonzero-sum games. J. Optim. Theor. Appl. 11(5), 533\u2013555 (1973)","journal-title":"J. Optim. Theor. Appl."},{"key":"45_CR14","unstructured":"Soma, T., Kakimura, N., Inaba, K., Kawarabayashi, K.: Optimal budget allocation: theoretical guarantee and efficient algorithm. In: Proceedings of the 31st International Conference on Machine Learning, ICML 2014, pp. 351\u2013359 (2014)"},{"key":"45_CR15","unstructured":"Staib, M., Jegelka, S.: Robust budget allocation via continuous submodular functions. In: Proceedings of the 34th International Conference on Machine Learning, ICML 2017, pp. 3230\u20133240 (2017)"},{"key":"45_CR16","unstructured":"Vanek, O., Yin, Z., Jain, M., Bosansk\u00fd, B., Tambe, M., Pechoucek, M.: Game-theoretic resource allocation for malicious packet detection in computer networks. In: Proceeding of the 11th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2012, pp. 905\u2013912 (2012)"},{"key":"45_CR17","doi-asserted-by":"crossref","unstructured":"Wilder, B., Vorobeychik, Y.: Defending elections against malicious spread of misinformation. In: Proceedings of the 33rd AAAI Conference on Artificial Intelligence AAAI 2019 (2019)","DOI":"10.1609\/aaai.v33i01.33012213"},{"key":"45_CR18","unstructured":"Yahoo: Yahoo! search marketing advertiser bidding data (2007). https:\/\/webscope.sandbox.yahoo.com\/catalog.php?datatype=a"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2019: Trends in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29908-8_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:24:31Z","timestamp":1709825071000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-29908-8_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030299071","9783030299088"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29908-8_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific Rim International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cuvu, Yanuka Island","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fiji","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2019","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":"pricai2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pricai.org\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}