Concise Bid Optimization Strategies with Multiple Budget Constraints

References

• Aggarwal G, Goel A, Motwani R (2006) Truthful auctions for pricing search keywords. Proc. 7th ACM Conf. Electronic Commerce (EC) (ACM, New York), 1–7.Crossref, Google Scholar
• Archak N, Mirrokni VS, Muthukrishnan S (2012) Budget optimization for online campaigns with positive carryover effects. Goldberg PW, Guo M, eds. Internet and Network Economics. WINE 2012. Lecture Notes in Computer Science, vol. 7695 (Springer, Berlin, Heidelberg), 86–99.Crossref, Google Scholar
• Asadpour A, Saberi A (2010) An approximation algorithm for max-min fair allocation of indivisible goods. SIAM J. Comput. 39(7):2970–2989.Crossref, Google Scholar
• Asadpour A, Goemans MX, Madry A, Oveis Gharan S, Saberi A (2017) An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem. Oper. Res. 65(4):1043–1061.Link, Google Scholar
• Bateni M, Feldman J, Mirrokni V, Wong SC (2014) Multiplicative bidding in online advertising. Babaioff M, Conitzer V, Easley D, eds. Proc. ACM Conf. Econom. Comput. (EC) (ACM, New York), 715–732.Crossref, Google Scholar
• Bing Ads (2013) Bing ads intelligence. Accessed March 5, 2018, https://blog.google/products/ads/Google Scholar
• Birkhoff G (1946) Three observations on linear algebra. Univ. Nac. Tacumán Rev. 5:147–151.Google Scholar
• Borgs C, Chayes JT, Immorlica N, Jain K, Etesami O, Mahdian M (2007) Dynamics of bid optimization in online advertisement auctions. Proc. 16th Internat. Conf. World Wide Web 2007 (ACM, New York), 531–540.Google Scholar
• Chung F, Lu L (2004) Coupling online and offline analyses for random power law graphs. Internet Math. 1(4):409–461.Crossref, Google Scholar
• Devanur NR, Hayes TP (2009) The adwords problem: Online keyword matching with budgeted bidders under random permutations. Proc. ACM Conf. Electronic Commerce (EC) (ACM, New York), 71–78.Crossref, Google Scholar
• Dobzinski S, Lavi R, Nisan N (2012) Multi-unit auctions with budget limits. Games Econom. Behav. 74(2):486–503.Crossref, Google Scholar
• Edelman B, Ostrovsky M, Schwarz M (2005) Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords. Amer. Econom. Rev. 97(1):242–259.Crossref, Google Scholar
• Even-Dar E, Mirrokni VS, Muthukrishnan S, Mansour Y, Nadav U (2009) Bid optimization for broad match ad auctions. Proc. 18th Internat. Conf. World Wide Web 2009 (ACM, New York), 231–240.Google Scholar
• Feldman J, Muthukrishnan S, Pal M, Stein C (2007) Budget optimization in search-based advertising auctions. Proc. 8th Conf. Electronic Commerce 2007 (ACM, New York), 40–49.Crossref, Google Scholar
• Feldman J, Henzinger M, Korula N, Mirrokni VS, Stein C (2010) Online stochastic packing applied to display ad allocation. Eur. Conf. Algorithms (ESA), Proc. 18th Annual Eur. Sympos. (ESA, Liverpool, UK), 182–194.Crossref, Google Scholar
• Feldman J, Korula N, Mirrokni VS, Muthukrishnan S, Pal M (2009) Online ad assignment with free disposal. Leonardi S, eds. Internet and Network Economics. WINE 2009, Lecture Notes in Computer Science, vol. 5929 (Springer, Berlin, Heidelberg), 374–385.Crossref, Google Scholar
• Goel G, Mirrokni VS, Paes Leme R (2012) Polyhedral clinching auctions and the adwords polytope. Proc. 44th Sympos. Theory Comput. Conf. 2012 (STOC, New York), 107–122.Crossref, Google Scholar
• Google Support (2011) Google adwords dynamic search ads. Accessed March 15, 2018, http://adwords.blogspot.fr/2011/10/introducing-_dynamic-_search-_ads-_beta.html.Google Scholar
• Google Support (2013a) Google adwords automatic bidding tools. Accessed March 15, 2018, http://support.google.com/adwords/bin/answer.py?hl=en\&answer=2470106.Google Scholar
• Google Support (2013b) Traffic estimator. Accessed March 15, 2018, http://support.google.com/adwords/bin/answer.py?hl=en\&answer=6329.Google Scholar
• Google Support (2013c) Using the bid simulator. Accessed March 15, 2018, http://support.google.com/adwords/bin/answer.py?hl=en\&answer=2470105.Google Scholar
• Google Support (2014) Setting bid adjustments. Accessed March 15, 2018, https://support.google.com/adwords/answer/2732132.Google Scholar
• Hastad J (1999) Clique is hard to approximate within n^{1-\eps}. Acta Math. 182(1):105–142.Crossref, Google Scholar
• IAB (2017) Internet advertising revenue report: 2016 full year results. Accessed March 15, 2018, https://www.iab.com/wp-_content/uploads/2016/04/IAB_Internet_Advertising_Revenue_Report_FY_2016.pdf.Google Scholar
• Kulik A, Shachnai H, Tamir T (2013) Approximations for monotone and non-monotone submodular maximization with knapsack constraints. Math. Oper. Res. 38(4):729–739.Link, Google Scholar
• Luenberger DG, Ye Y (2016) Linear and Nonlinear Programming, 4th ed., International Series in Operations Research & Management Science, vol. 228 (Springer, New York).Crossref, Google Scholar
• Mehta A, Saberi A, Vazirani UV, Vazirani VV (2007) Adwords and generalized online matching. J. ACM 54(5):22.Crossref, Google Scholar
• Muthukrishnan S, Pal M, Svitkina Z (2010) Stochastic models for budget optimization in search-based advertising. Algorithmica 58(4):1022–1044.Crossref, Google Scholar
• Panconesi A, Srinivasan A (1997) Randomized distributed edge coloring via an extension of the Chernoff-Hoeffding bounds. SIAM J. Comput. 26(2):350–368.Crossref, Google Scholar
• Rusmevichientong P, Williamson D (2006) An adaptive algorithm for selecting profitable keywords for search-based advertising services. Proc. 7th Conf. Electronic Commerce 2006 (ACM, New York), 260–269.Crossref, Google Scholar
• Singh M, Vishnoi NK (2014) Entropy, optimization and counting. Proc. 46th Annual ACM. Sympos. Theory Comput. 2014 (ACM, New York), 50–59.Crossref, Google Scholar
• Srinivasan A (2001) Distributions on level-sets with applications to approximation algorithms. 42nd Annual Sympos. Foundations Comput. Sci. 2001 (IEEE, Piscataway, NJ), 588–597.Crossref, Google Scholar
• Varian H (2007) Position auctions. Internat. J. Indust. Org. 25(6):1163–1178.Crossref, Google Scholar
• Vondrak J (2008) Optimal approximation for the submodular welfare problem in the value oracle model. Proc. 40th Annual Sympos. Theory Comput. 2008 (ACM, New York), 67–74.Crossref, Google Scholar
• von Neumann J (1953) A certain zero-sum two-person game equivalent to an optimal assignment problem. Ann. Math. Stud. 28:5–12.Google Scholar
• Zhou Y, Chakrabarty D, Lukose RM (2008) Budget constrained bidding in keyword auctions and online knapsack problems. Papadimitriou C, Zhang S, eds. Internet and Network Economics. WINE 2008, Lecture Notes in Computer Science, vol. 5385 (Springer, Berlin, Heidelberg), 566–576.Crossref, Google Scholar