Budget Optimization in Search-Based Advertising Auctions

@misc{citeulike:1151393, abstract = {Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been a lot of attention on the auction process and its game-theoretic aspects, our focus is on the advertisers. In particular, the advertisers have to solve a complex optimization problem of how to place bids on the keywords of their interest so that they can 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 keywords works well. More precisely, this strategy gets at least 1-1/e fraction of the maximum clicks possible. Such uniform strategies are likely to be practical. We also present inapproximability results, and optimal algorithms for variants of the budget optimization problem.}, author = {Feldman, Jon and Muthukrishnan, S. and Pal, Martin and Stein, Cliff }, citeulike-article-id = {1151393}, eprint = {cs.DS/0612052}, keywords = {algorithm, auction, game, random, search}, month = {Dec}, posted-at = {2007-03-09 15:02:20}, priority = {3}, title = {Budget Optimization in Search-Based Advertising Auctions}, url = {http://arxiv.org/abs/cs.DS/0612052}, year = {2006} }

TY - ELEC ID - citeulike:1151393 L3 - citeulike-article-id:1151393 TI - Budget Optimization in Search-Based Advertising Auctions N2 - Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been a lot of attention on the auction process and its game-theoretic aspects, our focus is on the advertisers. In particular, the advertisers have to solve a complex optimization problem of how to place bids on the keywords of their interest so that they can 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 keywords works well. More precisely, this strategy gets at least 1-1/e fraction of the maximum clicks possible. Such uniform strategies are likely to be practical. We also present inapproximability results, and optimal algorithms for variants of the budget optimization problem. KW - algorithm KW - auction KW - game KW - random KW - search AU - Feldman, Jon AU - Muthukrishnan, S AU - Pal, Martin AU - Stein, Cliff PY - 2006/Dec/08/ UR - http://arxiv.org/abs/cs.DS/0612052 ER -