EN
Back to the archive

The encyclopedia · Advertising & PR · Technical decision · 2002–2007

Google's ad auction charged winners the next bid, making honest bidding safe

Google sold search ads with a generalized second-price auction where winners pay the next bid, making truthful bidding safe and scaling to billions of dollars.

Google

the move

In the early 2000s Google needed to sell keyword advertising at scale without knowing what any advertiser's click was worth. Its generalized second-price (GSP) auction ranks advertisers and charges each winner only the bid just below its own position.

Edelman, Ostrovsky and Schwarz's 2005 working paper (published in the American Economic Review in 2007) analyzed GSP. Though it looks like the Vickrey–Clarke–Groves mechanism, GSP is not truthful in dominant strategies; the authors showed the corresponding generalized English auction has a unique equilibrium with the same payoffs as VCG.

That equilibrium is the mechanism's magic: bidding close to true value is the safe strategy, so advertisers stop gaming and the market prices itself. The paper's title — 'selling billions of dollars worth of keywords' — captured what the design made possible.

why it works

  • Winner pays the next bid, so overbidding only hurts yourself.
  • Ranking by bid turns budgets and beliefs into a price signal.
  • The unique equilibrium meant advertisers could stop gaming.
  • Academics proved the mechanism, giving it credibility.
the payoffWinner pays the next bid downinspired

what transfers

Auction design can be a product: the rule that makes honest bidding safe turns a messy keyword market into a self-sustaining revenue engine and a durable strategic moat.

what came after

GSP became the template for paid-search markets across the industry, and the 2007 American Economic Review paper became a standard reference in auction design as Google extended the mechanism with quality scoring and real-time bidding.

references

spotted an error? The archive wants to know.

same kind of clever