Proceedings of the 16th International Conference on World Wide Web 2007
DOI: 10.1145/1242572.1242644
|View full text |Cite
|
Sign up to set email alerts
|

Dynamics of bid optimization in online advertisement auctions

Abstract: We consider the problem of online keyword advertising auctions among multiple bidders with limited budgets, and study a natural bidding heuristic in which advertisers attempt to optimize their utility by equalizing their return-on-investment across all keywords. We show that existing auction mechanisms combined with this heuristic can experience cycling (as has been observed in many current systems), and therefore propose a modified class of mechanisms with small random perturbations. This perturbation is remi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
165
0

Year Published

2008
2008
2017
2017

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 196 publications
(165 citation statements)
references
References 14 publications
0
165
0
Order By: Relevance
“…There has also been recent work on optimal bidding strategies of advertisers (Hosanagar and Cherapanov 2008;Borgs et al 2007;Feldman et al 2007;Cary et al 2007). These papers present optimization models to compute the bids for all keywords in an advertiser's portfolio in order to maximize advertiser profits subject to a budget constraint.…”
Section: Prior Workmentioning
confidence: 99%
“…There has also been recent work on optimal bidding strategies of advertisers (Hosanagar and Cherapanov 2008;Borgs et al 2007;Feldman et al 2007;Cary et al 2007). These papers present optimization models to compute the bids for all keywords in an advertiser's portfolio in order to maximize advertiser profits subject to a budget constraint.…”
Section: Prior Workmentioning
confidence: 99%
“…In addition the bidders do not know the other bids or click-through rates. This makes the advertiser's optimization problem much more difficult (see e.g., [28,7,9,17,43,30,45,40,39] …”
Section: Practical Aspectsmentioning
confidence: 99%
“…7 Thus, if an advertiser has a bid on two different keywords that match the same query, this conflict must be resolved somehow. For example, if an advertiser has a bid out on the keywords "shoes" and "high-heel," then if a user issues the query "high-heel shoes," it will match on two different keywords.…”
Section: Keyword Interactionmentioning
confidence: 99%
“…A bidding strategy (bidding uniformly on all keywords) and its variants are explored in [24]. Certain basic dynamics have been understood [25], but more remains to be done.…”
Section: Budget Optimization and Biddingmentioning
confidence: 99%