{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T12:03:06Z","timestamp":1762430586166},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T00:00:00Z","timestamp":1346457600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Syst., Man, Cybern. A"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1109\/tsmca.2011.2172418","type":"journal-article","created":{"date-parts":[[2011,12,6]],"date-time":"2011-12-06T20:24:04Z","timestamp":1323203044000},"page":"1141-1151","source":"Crossref","is-referenced-by-count":44,"title":["A Budget Optimization Framework for Search Advertisements Across Markets"],"prefix":"10.1109","volume":"42","author":[{"given":"Yanwu","family":"Yang","sequence":"first","affiliation":[]},{"given":"Jie","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Rui","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Juanjuan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Fei-Yue","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Qi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1287\/opre.5.3.370"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1977.144"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.2307\/2551549"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9311-6"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1057\/palgrave.rpm.5160110","article-title":"Allocating expenditures across keywords in search advertising","volume":"6","author":"zluk","year":"2007","journal-title":"J Revenue Pricing Manage"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367747"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2010.104"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1064009.1064014"},{"key":"ref11","article-title":"Budget constrained bidding in keyword auctions and online knapsack problems","author":"chakrabarty","year":"2007","journal-title":"Proc Int World Wide Web Conf"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.02.031"},{"key":"ref13","author":"dasfupta","year":"2010","journal-title":"Stochastic Budget Optimization in Internet Advertising"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbusres.2005.03.010"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-004-6470-0"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250917"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79309-0_17"},{"key":"ref18","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4934.001.0001","author":"grossberg","year":"1992","journal-title":"Neural Networks and Natural Intelligence"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1988.23903"},{"key":"ref28","author":"mankiw","year":"1998","journal-title":"Principles of Economics"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2005.855918"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04128-0_15"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526742"},{"key":"ref6","article-title":"Budget optimization for online advertising campaigns with carryover effects","author":"archak","year":"2010","journal-title":"Proc 11th ACM SIGECOM Int Conf Electron Commerce"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77105-0_15"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02098169"},{"key":"ref8","first-page":"16","article-title":"A knapsack secretary problem with applications","volume":"4627","author":"babaioff","year":"2007","journal-title":"Proc APPROX-RANDOM"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref2","year":"0"},{"key":"ref9","author":"birge","year":"1997","journal-title":"Introduction to Stochastic Programming"},{"key":"ref1","year":"0"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.1989.118638"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2007.290"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2007.232"},{"key":"ref24","first-page":"228","article-title":"A trading agent and simulator for keyword auctions","author":"kitts","year":"2004","journal-title":"Proc 3rd Int l Joint Conf Autonomous Agents and Multi Agent Systems"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0925-2312(96)00009-4"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0165-0114(95)00086-0"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1060.0585"}],"container-title":["IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/3468\/6269132\/06095652.pdf?arnumber=6095652","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,19]],"date-time":"2021-12-19T01:33:32Z","timestamp":1639877612000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6095652\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9]]},"references-count":36,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tsmca.2011.2172418","relation":{},"ISSN":["1083-4427","1558-2426"],"issn-type":[{"value":"1083-4427","type":"print"},{"value":"1558-2426","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9]]}}}