Bid optimization for broad match Ad auctions

Eyal Even Dar, Vahab S. Mirrokni, Shanmugavelayutham Muthukrishnan, Yishay Mansour, Uri Nadav

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    Ad auctions in sponsored search support "broad match" that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving more expressiveness to advertisers, this feature makes it challenging to optimize bids to maximize their returns: choosing to bid on a query as a broad match because it provides high profit results in one bidding for related queries which may yield low or even negative profits. We abstract and study the complexity of the bid optimization problem which is to determine an advertiser's bids on a subset of keywords (possibly using broad match) so that her profit is maximized. In the query language model when the advertiser is allowed to bid on all queries as broad match, we present a linear programming (LP)-based polynomial-time algorithm that gets the optimal profit. In the model in which an advertiser can only bid on keywords, ie., a subset of keywords as an exact or broad match, we show that this problem is not approximable within any reasonable approximation factor unless P=NP. To deal with this hardness result, we present a constant-factor approximation when the optimal profit significantly exceeds the cost. This algorithm is based on rounding a natural LP formulation of the problem. Finally, we study a budgeted variant of the problem, and show that in the query language model, one can find two budget constrained ad campaigns in polynomial time that implement the optimal bidding strategy. Our results are the first to address bid optimization under the broad match feature which is common in ad auctions. Copyright is held by the International World Wide Web Conference Committee (IW3C2).

    Original languageEnglish (US)
    Title of host publicationWWW'09 - Proceedings of the 18th International World Wide Web Conference
    PublisherAssociation for Computing Machinery
    Pages231-240
    Number of pages10
    ISBN (Print)9781605584874
    DOIs
    StatePublished - Jan 1 2009
    Event18th International World Wide Web Conference, WWW 2009 - Madrid, Spain
    Duration: Apr 20 2009Apr 24 2009

    Publication series

    NameWWW'09 - Proceedings of the 18th International World Wide Web Conference

    Other

    Other18th International World Wide Web Conference, WWW 2009
    CountrySpain
    CityMadrid
    Period4/20/094/24/09

    Fingerprint

    Profitability
    Query languages
    Linear programming
    Polynomials
    World Wide Web
    Hardness
    Costs

    Keywords

    • Ad auctions
    • Bid optimization
    • Optimal bidding
    • Sponsored search

    ASJC Scopus subject areas

    • Computer Networks and Communications

    Cite this

    Even Dar, E., Mirrokni, V. S., Muthukrishnan, S., Mansour, Y., & Nadav, U. (2009). Bid optimization for broad match Ad auctions. In WWW'09 - Proceedings of the 18th International World Wide Web Conference (pp. 231-240). (WWW'09 - Proceedings of the 18th International World Wide Web Conference). Association for Computing Machinery. https://doi.org/10.1145/1526709.1526741

    Bid optimization for broad match Ad auctions. / Even Dar, Eyal; Mirrokni, Vahab S.; Muthukrishnan, Shanmugavelayutham; Mansour, Yishay; Nadav, Uri.

    WWW'09 - Proceedings of the 18th International World Wide Web Conference. Association for Computing Machinery, 2009. p. 231-240 (WWW'09 - Proceedings of the 18th International World Wide Web Conference).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Even Dar, E, Mirrokni, VS, Muthukrishnan, S, Mansour, Y & Nadav, U 2009, Bid optimization for broad match Ad auctions. in WWW'09 - Proceedings of the 18th International World Wide Web Conference. WWW'09 - Proceedings of the 18th International World Wide Web Conference, Association for Computing Machinery, pp. 231-240, 18th International World Wide Web Conference, WWW 2009, Madrid, Spain, 4/20/09. https://doi.org/10.1145/1526709.1526741
    Even Dar E, Mirrokni VS, Muthukrishnan S, Mansour Y, Nadav U. Bid optimization for broad match Ad auctions. In WWW'09 - Proceedings of the 18th International World Wide Web Conference. Association for Computing Machinery. 2009. p. 231-240. (WWW'09 - Proceedings of the 18th International World Wide Web Conference). https://doi.org/10.1145/1526709.1526741
    Even Dar, Eyal ; Mirrokni, Vahab S. ; Muthukrishnan, Shanmugavelayutham ; Mansour, Yishay ; Nadav, Uri. / Bid optimization for broad match Ad auctions. WWW'09 - Proceedings of the 18th International World Wide Web Conference. Association for Computing Machinery, 2009. pp. 231-240 (WWW'09 - Proceedings of the 18th International World Wide Web Conference).
    @inproceedings{dda2b25eecaa497a83d5ffb09d76145a,
    title = "Bid optimization for broad match Ad auctions",
    abstract = "Ad auctions in sponsored search support {"}broad match{"} that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving more expressiveness to advertisers, this feature makes it challenging to optimize bids to maximize their returns: choosing to bid on a query as a broad match because it provides high profit results in one bidding for related queries which may yield low or even negative profits. We abstract and study the complexity of the bid optimization problem which is to determine an advertiser's bids on a subset of keywords (possibly using broad match) so that her profit is maximized. In the query language model when the advertiser is allowed to bid on all queries as broad match, we present a linear programming (LP)-based polynomial-time algorithm that gets the optimal profit. In the model in which an advertiser can only bid on keywords, ie., a subset of keywords as an exact or broad match, we show that this problem is not approximable within any reasonable approximation factor unless P=NP. To deal with this hardness result, we present a constant-factor approximation when the optimal profit significantly exceeds the cost. This algorithm is based on rounding a natural LP formulation of the problem. Finally, we study a budgeted variant of the problem, and show that in the query language model, one can find two budget constrained ad campaigns in polynomial time that implement the optimal bidding strategy. Our results are the first to address bid optimization under the broad match feature which is common in ad auctions. Copyright is held by the International World Wide Web Conference Committee (IW3C2).",
    keywords = "Ad auctions, Bid optimization, Optimal bidding, Sponsored search",
    author = "{Even Dar}, Eyal and Mirrokni, {Vahab S.} and Shanmugavelayutham Muthukrishnan and Yishay Mansour and Uri Nadav",
    year = "2009",
    month = "1",
    day = "1",
    doi = "10.1145/1526709.1526741",
    language = "English (US)",
    isbn = "9781605584874",
    series = "WWW'09 - Proceedings of the 18th International World Wide Web Conference",
    publisher = "Association for Computing Machinery",
    pages = "231--240",
    booktitle = "WWW'09 - Proceedings of the 18th International World Wide Web Conference",

    }

    TY - GEN

    T1 - Bid optimization for broad match Ad auctions

    AU - Even Dar, Eyal

    AU - Mirrokni, Vahab S.

    AU - Muthukrishnan, Shanmugavelayutham

    AU - Mansour, Yishay

    AU - Nadav, Uri

    PY - 2009/1/1

    Y1 - 2009/1/1

    N2 - Ad auctions in sponsored search support "broad match" that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving more expressiveness to advertisers, this feature makes it challenging to optimize bids to maximize their returns: choosing to bid on a query as a broad match because it provides high profit results in one bidding for related queries which may yield low or even negative profits. We abstract and study the complexity of the bid optimization problem which is to determine an advertiser's bids on a subset of keywords (possibly using broad match) so that her profit is maximized. In the query language model when the advertiser is allowed to bid on all queries as broad match, we present a linear programming (LP)-based polynomial-time algorithm that gets the optimal profit. In the model in which an advertiser can only bid on keywords, ie., a subset of keywords as an exact or broad match, we show that this problem is not approximable within any reasonable approximation factor unless P=NP. To deal with this hardness result, we present a constant-factor approximation when the optimal profit significantly exceeds the cost. This algorithm is based on rounding a natural LP formulation of the problem. Finally, we study a budgeted variant of the problem, and show that in the query language model, one can find two budget constrained ad campaigns in polynomial time that implement the optimal bidding strategy. Our results are the first to address bid optimization under the broad match feature which is common in ad auctions. Copyright is held by the International World Wide Web Conference Committee (IW3C2).

    AB - Ad auctions in sponsored search support "broad match" that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving more expressiveness to advertisers, this feature makes it challenging to optimize bids to maximize their returns: choosing to bid on a query as a broad match because it provides high profit results in one bidding for related queries which may yield low or even negative profits. We abstract and study the complexity of the bid optimization problem which is to determine an advertiser's bids on a subset of keywords (possibly using broad match) so that her profit is maximized. In the query language model when the advertiser is allowed to bid on all queries as broad match, we present a linear programming (LP)-based polynomial-time algorithm that gets the optimal profit. In the model in which an advertiser can only bid on keywords, ie., a subset of keywords as an exact or broad match, we show that this problem is not approximable within any reasonable approximation factor unless P=NP. To deal with this hardness result, we present a constant-factor approximation when the optimal profit significantly exceeds the cost. This algorithm is based on rounding a natural LP formulation of the problem. Finally, we study a budgeted variant of the problem, and show that in the query language model, one can find two budget constrained ad campaigns in polynomial time that implement the optimal bidding strategy. Our results are the first to address bid optimization under the broad match feature which is common in ad auctions. Copyright is held by the International World Wide Web Conference Committee (IW3C2).

    KW - Ad auctions

    KW - Bid optimization

    KW - Optimal bidding

    KW - Sponsored search

    UR - http://www.scopus.com/inward/record.url?scp=77954944671&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=77954944671&partnerID=8YFLogxK

    U2 - 10.1145/1526709.1526741

    DO - 10.1145/1526709.1526741

    M3 - Conference contribution

    AN - SCOPUS:77954944671

    SN - 9781605584874

    T3 - WWW'09 - Proceedings of the 18th International World Wide Web Conference

    SP - 231

    EP - 240

    BT - WWW'09 - Proceedings of the 18th International World Wide Web Conference

    PB - Association for Computing Machinery

    ER -