Budget optimization in search-based advertising auctions

Jon Feldman, Shanmugavelayutham Muthukrishnan, Martin Pál, Cliff Stein

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

    Abstract

    Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work onthe auction process and its game-theoretic aspects, most of it focuses on the Internet company. In this work, we focus on the advertisers, who must solve a complex optimization problem to decide how to place bids on keywords to maximize their return (the number of user clicks on their ads) for a given budget. We model the entire process and study this budget optimization problem. While most variants are NP-hard, we show, perhaps surprisingly, that simply randomizing between two uniform strategies that bid equally on all the keywordsworks well. More precisely, this strategy gets at least a 1-1/ fraction of the maximum clicks possible. As our preliminary experiments show, such uniform strategies are likely to be practical. We also present inapproximability results, and optimal algorithms for variants of the budget optimization problem.

    Original languageEnglish (US)
    Title of host publicationEC'07 - Proceedings of the Eighth Annual Conference on Electronic Commerce
    Pages40-49
    Number of pages10
    DOIs
    StatePublished - Nov 30 2007
    Event8th ACM Conference on Electronic Commerce, EC'07 - San Diego, CA, United States
    Duration: Jun 11 2007Jun 15 2007

    Publication series

    NameEC'07 - Proceedings of the Eighth Annual Conference on Electronic Commerce

    Conference

    Conference8th ACM Conference on Electronic Commerce, EC'07
    CountryUnited States
    CitySan Diego, CA
    Period6/11/076/15/07

    Fingerprint

    Marketing
    Internet
    Industry
    Auctions
    Optimization problem
    Experiments
    Bid
    World Wide Web
    NP-hard
    Key words
    Query
    Experiment

    Keywords

    • Auctions
    • Bidding
    • Optimization
    • Sponsored search

    ASJC Scopus subject areas

    • Management of Technology and Innovation
    • Marketing
    • Computer Networks and Communications
    • Computer Science Applications

    Cite this

    Feldman, J., Muthukrishnan, S., Pál, M., & Stein, C. (2007). Budget optimization in search-based advertising auctions. In EC'07 - Proceedings of the Eighth Annual Conference on Electronic Commerce (pp. 40-49). (EC'07 - Proceedings of the Eighth Annual Conference on Electronic Commerce). https://doi.org/10.1145/1250910.1250917

    Budget optimization in search-based advertising auctions. / Feldman, Jon; Muthukrishnan, Shanmugavelayutham; Pál, Martin; Stein, Cliff.

    EC'07 - Proceedings of the Eighth Annual Conference on Electronic Commerce. 2007. p. 40-49 (EC'07 - Proceedings of the Eighth Annual Conference on Electronic Commerce).

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

    Feldman, J, Muthukrishnan, S, Pál, M & Stein, C 2007, Budget optimization in search-based advertising auctions. in EC'07 - Proceedings of the Eighth Annual Conference on Electronic Commerce. EC'07 - Proceedings of the Eighth Annual Conference on Electronic Commerce, pp. 40-49, 8th ACM Conference on Electronic Commerce, EC'07, San Diego, CA, United States, 6/11/07. https://doi.org/10.1145/1250910.1250917
    Feldman J, Muthukrishnan S, Pál M, Stein C. Budget optimization in search-based advertising auctions. In EC'07 - Proceedings of the Eighth Annual Conference on Electronic Commerce. 2007. p. 40-49. (EC'07 - Proceedings of the Eighth Annual Conference on Electronic Commerce). https://doi.org/10.1145/1250910.1250917
    Feldman, Jon ; Muthukrishnan, Shanmugavelayutham ; Pál, Martin ; Stein, Cliff. / Budget optimization in search-based advertising auctions. EC'07 - Proceedings of the Eighth Annual Conference on Electronic Commerce. 2007. pp. 40-49 (EC'07 - Proceedings of the Eighth Annual Conference on Electronic Commerce).
    @inproceedings{3f3ec5e616344558b5fad306760b5a10,
    title = "Budget optimization in search-based advertising auctions",
    abstract = "Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work onthe auction process and its game-theoretic aspects, most of it focuses on the Internet company. In this work, we focus on the advertisers, who must solve a complex optimization problem to decide how to place bids on keywords to maximize their return (the number of user clicks on their ads) for a given budget. We model the entire process and study this budget optimization problem. While most variants are NP-hard, we show, perhaps surprisingly, that simply randomizing between two uniform strategies that bid equally on all the keywordsworks well. More precisely, this strategy gets at least a 1-1/ fraction of the maximum clicks possible. As our preliminary experiments show, such uniform strategies are likely to be practical. We also present inapproximability results, and optimal algorithms for variants of the budget optimization problem.",
    keywords = "Auctions, Bidding, Optimization, Sponsored search",
    author = "Jon Feldman and Shanmugavelayutham Muthukrishnan and Martin P{\'a}l and Cliff Stein",
    year = "2007",
    month = "11",
    day = "30",
    doi = "10.1145/1250910.1250917",
    language = "English (US)",
    isbn = "159593653X",
    series = "EC'07 - Proceedings of the Eighth Annual Conference on Electronic Commerce",
    pages = "40--49",
    booktitle = "EC'07 - Proceedings of the Eighth Annual Conference on Electronic Commerce",

    }

    TY - GEN

    T1 - Budget optimization in search-based advertising auctions

    AU - Feldman, Jon

    AU - Muthukrishnan, Shanmugavelayutham

    AU - Pál, Martin

    AU - Stein, Cliff

    PY - 2007/11/30

    Y1 - 2007/11/30

    N2 - Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work onthe auction process and its game-theoretic aspects, most of it focuses on the Internet company. In this work, we focus on the advertisers, who must solve a complex optimization problem to decide how to place bids on keywords to maximize their return (the number of user clicks on their ads) for a given budget. We model the entire process and study this budget optimization problem. While most variants are NP-hard, we show, perhaps surprisingly, that simply randomizing between two uniform strategies that bid equally on all the keywordsworks well. More precisely, this strategy gets at least a 1-1/ fraction of the maximum clicks possible. As our preliminary experiments show, such uniform strategies are likely to be practical. We also present inapproximability results, and optimal algorithms for variants of the budget optimization problem.

    AB - Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work onthe auction process and its game-theoretic aspects, most of it focuses on the Internet company. In this work, we focus on the advertisers, who must solve a complex optimization problem to decide how to place bids on keywords to maximize their return (the number of user clicks on their ads) for a given budget. We model the entire process and study this budget optimization problem. While most variants are NP-hard, we show, perhaps surprisingly, that simply randomizing between two uniform strategies that bid equally on all the keywordsworks well. More precisely, this strategy gets at least a 1-1/ fraction of the maximum clicks possible. As our preliminary experiments show, such uniform strategies are likely to be practical. We also present inapproximability results, and optimal algorithms for variants of the budget optimization problem.

    KW - Auctions

    KW - Bidding

    KW - Optimization

    KW - Sponsored search

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

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

    U2 - 10.1145/1250910.1250917

    DO - 10.1145/1250910.1250917

    M3 - Conference contribution

    AN - SCOPUS:36448944683

    SN - 159593653X

    SN - 9781595936530

    T3 - EC'07 - Proceedings of the Eighth Annual Conference on Electronic Commerce

    SP - 40

    EP - 49

    BT - EC'07 - Proceedings of the Eighth Annual Conference on Electronic Commerce

    ER -