{"type":"ScholarlyArticle","title":"Robust Advertisement Allocation","authors":[{"name":"Shaojie Tang","slug":"shaojie-tang","given":"Shaojie","family":"Tang","affiliation":"School of Management University of Texas at Dallas"}],"abstract":"With the rapid growth of e-commerce and World Wide Web, internet advertising revenue has surpassed broadcast revenue very recently. As online advertising has become a major source of revenue for online publishers, such as Google and Amazon, one problem facing them is to optimize the ads selection and allocation in order to maximize their revenue.  Although there is a rich body of work that has been devoted to this field, uncertainty about models and parameter settings is largely ignored in existing algorithm design.  To fill this gap, we are the first to formulate and study the \\emph{Robust Ad Allocation} problem, by taking into account the uncertainty about parameter settings. We define a Robust Ad Allocation framework with a set of candidate parameter settings, typically derived from different users or topics. Our main aim is to develop robust ad allocation algorithms, which can provide satisfactory performance across a spectrum of parameter settings,  compared to the (parameter-specific) optimum solutions. We study this problem progressively and propose a series of algorithms with bounded approximation ratio.","doi":"10.24963/ijcai.2017/617","url":"https://ijcai.org/proceedings/2017/617","pdf":"https://ijcai.org/proceedings/2017/0617.pdf","markdown":"https://ijcai.org/proceedings/2017/617.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/617","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Planning and Scheduling","track":"Main track","number":617,"pages":{"first":4419,"last":4425},"keywords":["Planning and Scheduling: Planning Algorithms","Planning and Scheduling: Planning under Uncertainty"],"videos":[],"references":[{"position":1,"raw":"[Aggarwal et al., 2008] Gagan Aggarwal, Jon Feldman, S Muthukrishnan, and Martin Pál. Sponsored search auctions with markovian users. In International Work- shop on Internet and Network Economics, pages 621-628. Springer, 2008.","title":"Sponsored search auctions with markovian users","authors":"Gagan Aggarwal, Jon Feldman, S Muthukrishnan, Martin Pál","year":"2008","venue":"International Workshop on Internet and Network Economics","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Attenberg et al., 2009] Josh Attenberg, Sandeep Pandey, and Torsten Suel. Modeling and predicting user behav- ior in sponsored search. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discov- ery and data mining, pages 1067-1076. ACM, 2009.","title":"Modeling and predicting user behavior in sponsored search","authors":"Josh Attenberg, Sandeep Pandey, Torsten Suel","year":"2009","venue":"Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Baldacci et al., 2013] Roberto Baldacci, Aristide Mingozzi, Roberto Roberti, and Roberto Wolfler Calvo. An exact algorithm for the two-echelon capacitated vehicle routing problem. Operations Research, 61(2):298-314, 2013.","title":"An exact algorithm for the two-echelon capacitated vehicle routing problem","authors":"Roberto Baldacci, Aristide Mingozzi, Roberto Roberti, Roberto Wolfler, Calvo","year":"2013","venue":"Operations Research","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Craswell et al., 2008] Nick Craswell, Onno Zoeter, Michael Taylor, and Bill Ramsey. An experimental comparison of click position-bias models. In Proceedings of the 2008 In- ternational Conference on Web Search and Data Mining, pages 87-94. ACM, 2008.","title":"An experimental comparison of click position-bias models","authors":"Nick Craswell, Onno Zoeter, Michael Taylor, Bill Ramsey","year":"2008","venue":"Proceedings of the 2008 International Conference on Web Search and Data Mining","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Dembczynski et al., 2008] Krzysztof Dembczynski, Woj- ciech Kotlowski, and Dawid Weiss. Predicting ads click- through rate with decision rules. In Workshop on targeting and ranking in online advertising, volume 2008, 2008.","title":"Predicting ads clickthrough rate with decision rules","authors":"Krzysztof Dembczynski, Wojciech Kotlowski, Dawid Weiss","year":"2008","venue":"Workshop on targeting and ranking in online advertising","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Edelman et al., 2005] Benjamin Edelman, Michael Ostro- vsky, and Michael Schwarz. Internet advertising and the generalized second price auction: Selling billions of dol- lars worth of keywords. Technical report, National Bureau of Economic Research, 2005.","title":"Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords","authors":"Benjamin Edelman, Michael Ostrovsky, Michael Schwarz","year":"2005","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Gerken, 2008] David A Gerken. System and method for s- electively acquiring and targeting online advertising based on user ip address, May 20 2008. US Patent 7,376,714.","title":"System and method for selectively acquiring and targeting online advertising based on user ip address","authors":"David A Gerken","year":"2008","venue":"US Patent","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Ghosh and Mahdian, 2008] Arpita Ghosh and Mohammad Mahdian. Externalities in online advertising. In Proceed- ings of the 17th international conference on World Wide Web, pages 161-168. ACM, 2008.","title":"Externalities in online advertising","authors":"Arpita Ghosh, Mohammad Mahdian","year":"2008","venue":"Proceedings of the 17th international conference on World Wide Web","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Giura et al., 2014] Paul Giura, Ilona Murynets, Roger Pi- queras Jover, and Yevgeniy Vahlis. Is it really you?: user identification via adaptive behavior fingerprinting. In Pro- ceedings of the 4th ACM conference on Data and applica- tion security and privacy, pages 333-344. ACM, 2014.","title":"Is it really you?: user identification via adaptive behavior fingerprinting","authors":"Paul Giura, Ilona Murynets, Roger Piqueras Jover, Yevgeniy Vahlis","year":"2014","venue":"Proceedings of the 4th ACM conference on Data and application security and privacy","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Gomes et al., 2009] Renato Gomes, Nicole Immorlica, and Evangelos Markakis. Externalities in keyword auctions: An empirical and theoretical assessment. In Internation- al Workshop on Internet and Network Economics, pages 172-183. Springer, 2009.","title":"Externalities in keyword auctions: An empirical and theoretical assessment","authors":"Renato Gomes, Nicole Immorlica, Evangelos Markakis","year":"2009","venue":"International Workshop on Internet and Network Economics","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Grötschel et al., 1981] Martin Grötschel, László Lovász, and Alexander Schrijver. The ellipsoid method and its con- sequences in combinatorial optimization. Combinatorica, 1(2):169-197, 1981.","title":"The ellipsoid method and its consequences in combinatorial optimization","authors":"Martin Grötschel, László Lovász, Alexander Schrijver","year":"1981","venue":"Combinatorica","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Harvey et al., 2010] William Morris Harvey, Gerald Leo Despain, Mark Lieberman, Brian P Canning, and Pavel Bochman. Analyzing return on investment of advertis- ing campaigns by matching multiple data sources, June 1 2010. US Patent 7,729,940.","title":"Analyzing return on investment of advertising campaigns by matching multiple data sources","authors":"William Morris, Harvey, Gerald Leo Despain, Mark Lieberman, Brian P Canning, Pavel Bochman","year":"2010","venue":"US Patent","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[He and Kempe, 2016] Xinran He and David Kempe. Robust influence maximization. In Proceedings of the 22Nd ACM SIGKDD International Conference on Knowledge Discov- ery and Data Mining, KDD '16, pages 885-894, New Y- ork, NY, USA, 2016. ACM.","title":"Robust influence maximization","authors":"Kempe He, Xinran He, David Kempe","year":"2016","venue":"Proceedings of the 22Nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '16","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Hwang et al., 2013] Hark-Chin Hwang, Hyun-Soo Ahn, and Philip Kaminsky. Basis paths and a polynomial algo- rithm for the multistage production-capacitated lot-sizing problem. Operations Research, 61(2):469-482, 2013.","title":"Basis paths and a polynomial algorithm for the multistage production-capacitated lot-sizing problem","authors":"Hark-Chin Hwang, Hyun-Soo Ahn, Philip Kaminsky","year":"2013","venue":"Operations Research","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Kempe and Mahdian, 2008] David Kempe and Mohammad Mahdian. A cascade model for externalities in sponsored search. In International Workshop on Internet and Net- work Economics, pages 585-596. Springer, 2008.","title":"A cascade model for externalities in sponsored search","authors":"David Kempe, Mohammad Mahdian","year":"2008","venue":"International Workshop on Internet and Network Economics","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Lahaie et al., 2007] Sébastien Lahaie, David M Pennock, Amin Saberi, and Rakesh V Vohra. Sponsored search auc- tions. Algorithmic game theory, pages 699-716, 2007.","title":"Sponsored search auctions","authors":"Sébastien Lahaie, David M Pennock, Amin Saberi, Rakesh, Vohra","year":"2007","venue":"Algorithmic game theory","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Lai et al., 2010] Guoming Lai, Franc ¸ois Margot, and Nico- la Secomandi. An approximate dynamic programming ap- proach to benchmark practice-based heuristics for natural gas storage valuation. Operations research, 58(3):564- 582, 2010.","title":"Guoming Lai, Franc ¸ois Margot, and Nicola Secomandi. An approximate dynamic programming approach to benchmark practice-based heuristics for natural gas storage valuation","authors":"Lai","year":"2010","venue":"Operations research","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Lindsay et al., 2009] Robert Taaffe Lindsay, Thomas Car- riero, and Yun-Fang Juan. Measuring impact of online advertising campaigns, May 26 2009. US Patent App. 12/472,318.","title":"Measuring impact of online advertising campaigns","authors":"Robert Taaffe, Lindsay, Thomas Carriero, Yun-Fang Juan","year":"2009","venue":"US Patent","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[McMahan and Gordon, 2003] H Brendan McMahan and Geoffrey J Gordon. Planning in cost-paired markov de- cision process games. In NIPS Workshop: Planning for the Real-World, volume 3, 2003.","title":"Planning in cost-paired markov decision process games","authors":"Brendan Mcmahan, Geoffrey J Gordon","year":"2003","venue":"NIPS Workshop: Planning for the Real-World","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[McMahan et al., 2003] H Brendan McMahan, Geoffrey J Gordon, and Avrim Blum. Planning in the presence of cost functions controlled by an adversary. In ICML, pages 536-543, 2003.","title":"Planning in the presence of cost functions controlled by an adversary","authors":"Geoffrey J H Brendan Mcmahan, Avrim Gordon, Blum","year":"2003","venue":"ICML","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"Hal R Varian. Position auctions. internation- al Journal of industrial Organization, 25(6):1163-1178, 2007.","title":"Position auctions","authors":"Hal R Varian","year":"2007","venue":"international Journal of industrial Organization","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Wang et al., 2013] Taifeng Wang, Jiang Bian, Shusen Liu, Yuyu Zhang, and Tie-Yan Liu. Psychological advertising: exploring user psychology for click prediction in spon- sored search. In Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and da- ta mining, pages 563-571. ACM, 2013.","title":"Psychological advertising: exploring user psychology for click prediction in sponsored search","authors":"Taifeng Wang, Jiang Bian, Shusen Liu, Yuyu Zhang, Tie-Yan Liu","year":"2013","venue":"Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[White et al., 2014] Ryen W White, Ahmed Hassan, Adish Singla, and Eric Horvitz. From devices to people: Attribu- tion of search activity in multi-user settings. In Proceed- ings of the 23rd international conference on World wide web, pages 431-442. ACM, 2014.","title":"From devices to people: Attribution of search activity in multi-user settings","authors":"Ahmed Ryen W White, Adish Hassan, Eric Singla, Horvitz","year":"2014","venue":"Proceedings of the 23rd international conference on World wide web","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Xiong et al., 2012] Chenyan Xiong, Taifeng Wang, Wenkui Ding, Yidong Shen, and Tie-Yan Liu. Relational click pre- diction for sponsored search. In Proceedings of the fifth ACM international conference on Web search and data mining, pages 493-502. ACM, 2012.","title":"Relational click prediction for sponsored search","authors":"Xiong","year":"2012","venue":"Proceedings of the fifth ACM international conference on Web search and data mining","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}