6,106 research outputs found

    Bid Optimization by Multivariable Control in Display Advertising

    Full text link
    Real-Time Bidding (RTB) is an important paradigm in display advertising, where advertisers utilize extended information and algorithms served by Demand Side Platforms (DSPs) to improve advertising performance. A common problem for DSPs is to help advertisers gain as much value as possible with budget constraints. However, advertisers would routinely add certain key performance indicator (KPI) constraints that the advertising campaign must meet due to practical reasons. In this paper, we study the common case where advertisers aim to maximize the quantity of conversions, and set cost-per-click (CPC) as a KPI constraint. We convert such a problem into a linear programming problem and leverage the primal-dual method to derive the optimal bidding strategy. To address the applicability issue, we propose a feedback control-based solution and devise the multivariable control system. The empirical study based on real-word data from Taobao.com verifies the effectiveness and superiority of our approach compared with the state of the art in the industry practices

    Inefficiencies in Digital Advertising Markets

    Get PDF
    Digital advertising markets are growing and attracting increased scrutiny. This article explores four market inefficiencies that remain poorly understood: ad effect measurement, frictions between and within advertising channel members, ad blocking, and ad fraud. Although these topics are not unique to digital advertising, each manifests in unique ways in markets for digital ads. The authors identify relevant findings in the academic literature, recent developments in practice, and promising topics for future research

    "To Sponsor or not to Sponsor: Sponsored Search Auctions with Organic Links"

    Get PDF
    In 2010 sponsored search advertisements generated over $12 billion in revenue for search engines in the US market and accounted for 46% of online advertising revenue. A substantial portion of this revenue was generated by the sale of search keywords using auction mechanism. We analyze a game-theoretic model to understand the interplay between organic and sponsored links in keyword auctions. Our model allows both the relevance of the advertising firm as well as the position of its sponsored link to impact click-through-rates. Our results demonstrate how the presence of organic links (links generated by the search engine algorithm) may lead to either more or less aggressive bidding for sponsored link positions depending on consumers attitudes toward sponsored links and the extent to which sponsored and organic links are complements or substitutes. In contrast to equilibrium results in existing literature, the firm with the highest value per click does not necessarily win the first spot in the sponsored search listing. It also may be optimal for a firm to bid an amount greater than the expected value (or sale) from a click.sponsored search, organic search, online advertising, keyword auction

    Optimal Real-Time Bidding Strategies

    Full text link
    The ad-trading desks of media-buying agencies are increasingly relying on complex algorithms for purchasing advertising inventory. In particular, Real-Time Bidding (RTB) algorithms respond to many auctions -- usually Vickrey auctions -- throughout the day for buying ad-inventory with the aim of maximizing one or several key performance indicators (KPI). The optimization problems faced by companies building bidding strategies are new and interesting for the community of applied mathematicians. In this article, we introduce a stochastic optimal control model that addresses the question of the optimal bidding strategy in various realistic contexts: the maximization of the inventory bought with a given amount of cash in the framework of audience strategies, the maximization of the number of conversions/acquisitions with a given amount of cash, etc. In our model, the sequence of auctions is modeled by a Poisson process and the \textit{price to beat} for each auction is modeled by a random variable following almost any probability distribution. We show that the optimal bids are characterized by a Hamilton-Jacobi-Bellman equation, and that almost-closed form solutions can be found by using a fluid limit. Numerical examples are also carried out

    To Sponsor or Not to Sponsor: Sponsored Search Auctions with Organic Links

    Get PDF
    In 2010 sponsored search advertisements generated over $12 billion in revenue for search engines in the US market and accounted for 46% of online advertising revenue. A substantial portion of this revenue was generated by the sale of search keywords using an auction mechanism. We analyze a game-theoretic model to understand the interplay between organic and sponsored links in keyword auctions. Our model allows both the relevance of the advertising firm as well as the position of its sponsored link to impact click-through-rates. Our results demonstrate how the presence of organic links (links generated by the search engine algorithm) may lead to either more or less aggressive bidding for sponsored link positions depending on consumer attitudes toward sponsored links and the extent to which sponsored and organic links are complements or substitutes. In contrast to equilibrium results in existing literature, the Â…rm with the highest value per click does not necessarily win the first spot in the sponsored search listings. It also may be optimal for a firm to bid an amount greater than the expected value (or sale) from a click.
    • …
    corecore