Optimal keyword bidding in search-based advertising with budget constraint and stochastic ad position

References

• Abhishek, V., & Hosanagar, K. (2013). Optimal bidding in multi-item multislot sponsored search auctions. Operations Research, 61(4), 855–873. doi: 10.1287/opre.2013.1187
   Web of Science ®Google Scholar
• Amaldoss, W., Desai, P., & Shin, W. (2015). Keyword search advertising and first-page bid estimates: a strategic analysis. Management Science, 61(3), 507–519. doi: 10.1287/mnsc.2014.2033
   Web of Science ®Google Scholar
• Ayanso, A., & Karimi, A. (2015). The moderating effects of keyword competition on the determinants of ad position in sponsored search advertising. Decision Support Systems, 70, 42–59. doi: 10.1016/j.dss.2014.11.009
   Web of Science ®Google Scholar
• Ayanso, A., & Mokaya, B. (2013). Efficiency evaluation in search advertising. Decision Sciences, 44(5), 877–913. doi: 10.1111/deci.12038
   Web of Science ®Google Scholar
• Brethauer, K., & Shetty, B. (1995). The nonlinear resource allocation problem. Operations Research, 43(4), 670–683. doi: 10.1287/opre.43.4.670
   Web of Science ®Google Scholar
• Brethauer, K., & Shetty, B. (2002). The nonlinear knapsack problem - algorithms and applications. European Journal of Operational Research, 138, 459–472. doi: 10.1016/S0377-2217(01)00179-5
   Web of Science ®Google Scholar
• Brooks, N. (2004a). The Atlas rank report: How search engine rank impacts traffic. Retrieved from www.atlassolutions.com/pdf/rankreportpart.pdf
   Google Scholar
• Brooks, N. (2004b). The Atlas Rank Report II: How Search Engine Rank Impacts Conversions. Retrieved from www.atlassolutions.com/pdf/rankreportpart2.pdf
   Google Scholar
• Chan, T., Wu, C., & Xie, Y. (2011). Measuring the lifetime value of customers acquired from google search advertising. Marketing Science, 30(5), 837–850. doi: 10.1287/mksc.1110.0658
   Web of Science ®Google Scholar
• Cholette, S., Özlük, O., & Parlar, M. (2012). Optimal keyword bids in search-based advertising with stochastic advertisement positions. Journal of Optimization Theory and Applications, 152(1), 225–244. doi: 10.1007/s10957-011-9886-3
   Web of Science ®Google Scholar
• Devenur, N., & Hayes, T. (2009). The adwords problem: online keyword matching with budgeted bidders under random permutations. In Proceedings of the 10th ACM Conference on Electronic Commerce, Stanford, California (pp. 71–78).
   Google Scholar
• Edelman, B., & Schwarz, M. (2006). Optimal auction design in a multi-unit environment: The case of sponsored search auctions. Unpublished manuscript, Harvard Business School.
   Google Scholar
• Feldman, J., Muthukrishnan, S., Pal, M., & Stein, C. (2007). Budget optimization in search-based advertising auctions. In Proceedings of the 8th ACM Conference on Electronic Commerce, Chicago, Illinois (p. 40–49).
   Google Scholar
• Feng, J., Bhargava, H., & Pennock, D. (2007). Implementing sponsored search in web search engines: Computational evaluation of alternative mechanisms. INFORMS Journal on Computing, 19(1), 137–148. doi: 10.1287/ijoc.1050.0135
   Web of Science ®Google Scholar
• IAB (2015). IAB - internet advertising revenue report.
   Google Scholar
• Jansen, J., & Mullen, T. (2008). Sponsored search: An overview of the concept, history and technology. International Journal of Electronic Business, 6(2), 114–131. doi: 10.1504/IJEB.2008.018068
   Google Scholar
• Jerath, K., Ma, L., Park, Y., & Srinivasan, K. (2011). A position paradox in sponsored search auctions. Marketing Science, 30(4), 612–627. doi: 10.1287/mksc.1110.0645
   Web of Science ®Google Scholar
• Katona, Z., & Sarvary, M. (2010). The race for sponsored links: Bidding patterns for search advertising. Marketing Science, 29(2), 199–215. doi: 10.1287/mksc.1090.0517
   Web of Science ®Google Scholar
• Lu, S., Zhu, Y., & Dukes, A. (2015). Position auctions with budget constraints: Implications for advertisers and publishers. Marketing Science, 34(6), 897–905. doi: 10.1287/mksc.2015.0931
   Web of Science ®Google Scholar
• Nabout, N. (2015). A novel approach for bidding on keywords in newly set-up search advertising campaigns. European Journal of Marketing, 49, 668–691. doi:10.1108/EJM-08-2013-0424.
   Web of Science ®Google Scholar
• Nittala, C., & Narahari, Y. (2012). Optimal equilibrium bidding strategies for budget constrained bidders in sponsored search auctions. Operational Research, 12(3), 317–343. doi: 10.1007/s12351-010-0097-8
   Web of Science ®Google Scholar
• Özlük, O., & Cholette, S. (2007). Allocating expenditures across keywords in search advertising. Journal of Revenue and Pricing Management, 6(4), 347–356. doi: 10.1057/palgrave.rpm.5160110
   Google Scholar
• Regelson, M., & Fain, D. (2006). Predicting click-through rate using keyword clusters. In Proceedings of the Second Workshop on Sponsored Search Auctions.
   Google Scholar
• Selçuk, B., & Özlük, O. (2013). Optimal keyword bidding in search-based advertising with target exposure levels. European Journal of Operational Research, 226(1), 163–172. doi: 10.1016/j.ejor.2012.10.032
   Web of Science ®Google Scholar
• Shin, W. (2015). Keyword search advertising and limited budgets. Marketing Science, 34(6), 882–896. doi: 10.1287/mksc.2015.0915
   Web of Science ®Google Scholar
• Yang, S., & Ghose, A. (2010). Analyzing the relationship between organic and sponsored search advertising: Positive, negative, or zero interdependence. Marketing Science, 29(4), 602–623. doi: 10.1287/mksc.1090.0552
   Web of Science ®Google Scholar
• Yang, S., Lu, S., & Lu, X. (2014). Modeling competition and its impact on paid-search advertising. Marketing Science, 33(1), 134–153. doi: 10.1287/mksc.2013.0812
   Web of Science ®Google Scholar
• Zhao, L., & Nagurney, A. (2008). A network equilibrium framework for internet advertising: Models, qualitative analysis, and algorithms. European Journal of Operational Research, 187(2), 456–472. doi: 10.1016/j.ejor.2007.03.038
   Web of Science ®Google Scholar
• Zhou, Y., Chakrabarty, D., & Lukose, R. (2007). Budget constrained bidding in keyword auctions and online knapsack problems. Lecture Notes in Computer Science, 5385/2008, 566–576.
   Google Scholar