Sponsored search auction

Last updated

A sponsored search auction (SSA), also known as a keyword auction, is an indispensable part of the business model of modern web hosts. It refers to results from a search engine that are not output by the main search algorithm, but rather clearly separate advertisements paid for by third parties. These advertisements are typically related to the terms for which the user searched. They come in the form of a link and some information, with the hope that a search user will click on the link and buy something from the advertiser. In sponsored search auctions, there are typically some fixed number of slots for advertisements and more advertisers that want these slots than there are slots. The advertisers have different valuations for these slots and slots are a scarce resource, so an auction is done to determine how the slots will be assigned.

Contents

History

Prior to 1998, many advertisements were charged by impression, as it was the easiest metric to calculate. In 1998, GoTo.com, Inc debuted a pay-per-click charging system, with pricing and slot placement determined by an auction. GoTo used a first price auction, where bidders were placed according to their bids and charged their bids when they won. GoTo faced bidders who were constantly changing their bid in response to new information and changing information from other bidders.

Currently, charging per action is a common pricing scheme in affiliate networks, such as the Amazon Associates Program.

In 2002, Google Ads began using a second price auction to sell the single advertisement slot. Shortly thereafter, pages had multiple advertisements slots, which were allocated and sold via generalized second-price auction (GSP) auction, the natural generalization of a second price, single item, multi bidder auction. [1]

Marketing activities related to the sponsored search are increasingly contracted out to specialized digital marketing agencies (DMAs). Thousands of DMAs operate in the US market, but most of them belong to one of the seven agency networks, which also bid on behalf of their clients for keywords for sponsored search. [2] This phenomenon has increased the fraction of auctions in which the same agency bids on behalf of different advertisers, thereby altering the normal functioning of standard sponsored search auction mechanisms, such as the generalized second-price auction and the Vickrey–Clarke–Groves auction. [3]

Auction Mechanisms

Generalized Second Price Auction

Generalized second-price auction (GSP) is the most commonly used auction mechanism for sponsored search.

Untruthfulness

An issue with GSP is that it's not a truthful auction and it is not the optimal strategy. To illustrate this, consider the following example.

There are three bidders with only two possible slots. The values of each bidders 1, 2, and 3 are $10, $5, and $3 respectively. Suppose that the first slot click through rate (CTR) is 300 and the second slot CTR is 290. If bidder 1 is truthful, he would have to pay for a utility of . However, if bidder 1 decides to lie and reports a value of $4 instead then his utility would be . Notice that which makes GSP untruthful and bidders have an incentive to lie.

Quality Variant

Google uses a minor variant of GSP to auction off advertisement slots. Potential advertisements may be of varying quality. Suppose that there are two advertisements for eggs. One advertisement simply fills its space with the word “egg” repeated over and over, while the other advertisement shows a picture of eggs, contains branding information, and mentions positive qualities about their eggs, such as cage-freeness. The second advertisement may be thought of as having higher quality than the first advertisement, being more useful to consumers, more likely to be clicked on, and more likely to generate revenue for both the advertiser and Google. Advertisements that have a history of high click through rates, are geographically targeted at the user, or have a high quality landing page may also be thought of as having higher quality. [4]

Google assigns a numeric “quality” score to each bidder . Bidders, rather than being ordered purely by their bid, are instead ordered by rank, which is the product of their bid and quality score . Slots are still assigned in decreasing rank order. Bidders are charged (rather than the bid of the bidder one rank lower, ) the minimum price for which, if it was their bid, would keep them in their current rank: .

Vickrey–Clarke–Groves Auction

Vickrey–Clarke–Groves auction (VCG) is a truthful auction optimizing social welfare. VCG is more complicated to explain than GSP and that might deter many websites from using a VCG auction mechanism even though it's truthful. However, some websites use VCG as their auction mechanism, most notably Facebook.

See also

Related Research Articles

<span class="mw-page-title-main">Mechanism design</span> Field in game theory

Mechanism design is a field in economics and game theory that takes an objectives-first approach to designing economic mechanisms or incentives, toward desired objectives, in strategic settings, where players act rationally. Because it starts at the end of the game, then goes backwards, it is also called reverse game theory. It has broad applications, from economics and politics in fields such as market design, auction theory and social choice theory to networked-systems.

Google AdSense is a program run by Google through which website publishers in the Google Network of content sites serve text, images, video, or interactive media advertisements that are targeted to the site content and audience. These advertisements are administered, sorted, and maintained by Google. They can generate revenue on either a per-click or per-impression basis. Google beta-tested a cost-per-action service, but discontinued it in October 2008 in favor of a DoubleClick offering. In Q1 2014, Google earned US$3.4 billion, or 22% of total revenue, through Google AdSense. AdSense is a participant in the AdChoices program, so AdSense ads typically include the triangle-shaped AdChoices icon. This program also operates on HTTP cookies. In 2021, over 38.3 million websites use AdSense.

In Mechanism design, a strategyproof (SP) mechanism is a game in which each player has a weakly-dominant strategy, so that no player can gain by "spying" over the other players to know what they are going to play. When the players have private information, and the strategy space of each player consists of the possible information values, a truthful mechanism is a game in which revealing the true information is a weakly-dominant strategy for each player. i.e. given no information about what the others do, you fare best or at least not worse by being truthful. An SP mechanism is also called dominant-strategy-incentive-compatible (DSIC), to distinguish it from other kinds of incentive compatibility.

Pay-per-click (PPC) is an internet advertising model used to drive traffic to websites, in which an advertiser pays a publisher when the ad is clicked.

<span class="mw-page-title-main">Vickrey auction</span> Auction priced by second-highest sealed bid

A Vickrey auction or sealed-bid second-price auction (SBSPA) is a type of sealed-bid auction. Bidders submit written bids without knowing the bid of the other people in the auction. The highest bidder wins but the price paid is the second-highest bid. This type of auction is strategically similar to an English auction and gives bidders an incentive to bid their true value. The auction was first described academically by Columbia University professor William Vickrey in 1961 though it had been used by stamp collectors since 1893. In 1797 Johann Wolfgang von Goethe sold a manuscript using a sealed-bid, second-price auction.

<span class="mw-page-title-main">Japanese auction</span>

A Japanese auction is a dynamic auction format. It proceeds in the following way.

<span class="mw-page-title-main">Double auction</span>

A double auction is a process of buying and selling goods with multiple sellers and multiple buyers. Potential buyers submit their bids and potential sellers submit their ask prices to the market institution, and then the market institution chooses some price p that clears the market: all the sellers who asked less than p sell and all buyers who bid more than p buy at this price p. Buyers and sellers that bid or ask for exactly p are also included. A common example of a double auction is stock exchange.

<span class="mw-page-title-main">Auction theory</span> Branch of applied economics regarding the behavior of bidders in auctions

Auction theory is an applied branch of economics which deals with how bidders act in auction markets and researches how the features of auction markets incentivise predictable outcomes. Auction theory is a tool used to inform the design of real-world auctions. Sellers use auction theory to raise higher revenues while allowing buyers to procure at a lower cost. The conference of the price between the buyer and seller is an economic equilibrium. Auction theorists design rules for auctions to address issues which can lead to market failure. The design of these rulesets encourages optimal bidding strategies among a variety of informational settings. The 2020 Nobel Prize for Economics was awarded to Paul R. Milgrom and Robert B. Wilson “for improvements to auction theory and inventions of new auction formats.”

<span class="mw-page-title-main">First-price sealed-bid auction</span> Auction where all participants concurrently submit undisclosed bids

A first-price sealed-bid auction (FPSBA) is a common type of auction. It is also known as blind auction. In this type of auction, all bidders simultaneously submit sealed bids so that no bidder knows the bid of any other participant. The highest bidder pays the price that was submitted.

In Internet marketing, search advertising is a method of placing online advertisements on web pages that show results from search engine queries. Through the same search-engine advertising services, ads can also be placed on Web pages with other published content.

<span class="mw-page-title-main">Vickrey–Clarke–Groves auction</span> Type of sealed-bid multiple-item auction

A Vickrey–Clarke–Groves (VCG) auction is a type of sealed-bid auction of multiple items. Bidders submit bids that report their valuations for the items, without knowing the bids of the other bidders. The auction system assigns the items in a socially optimal manner: it charges each individual the harm they cause to other bidders. It gives bidders an incentive to bid their true valuations, by ensuring that the optimal strategy for each bidder is to bid their true valuations of the items; it can be undermined by bidder collusion and in particular in some circumstances by a single bidder making multiple bids under different names. It is a generalization of a Vickrey auction for multiple items.

<span class="mw-page-title-main">Market design</span>

Market design is a practical methodology for creation of markets of certain properties, which is partially based on mechanism design. In some markets, prices may be used to induce the desired outcomes — these markets are the study of auction theory. In other markets, prices may not be used — these markets are the study of matching theory.

<span class="mw-page-title-main">Generalized second-price auction</span> Search auction mechanism

The generalized second-price auction (GSP) is a non-truthful auction mechanism for multiple items. Each bidder places a bid. The highest bidder gets the first slot, the second-highest, the second slot and so on, but the highest bidder pays the price bid by the second-highest bidder, the second-highest pays the price bid by the third-highest, and so on. First conceived as a natural extension of the Vickrey auction, it conserves some of the desirable properties of the Vickrey auction. It is used mainly in the context of keyword auctions, where sponsored search slots are sold on an auction basis. The first analyses of GSP are in the economics literature by Edelman, Ostrovsky, and Schwarz and by Varian. It is used by Google's AdWords technology and Facebook.

First passage percolation is a mathematical method used to describe the paths reachable in a random medium within a given amount of time.

<span class="mw-page-title-main">Generalized first-price auction</span>

The generalized first-price auction (GFP) is a non-truthful auction mechanism for sponsored search. In sponsored search n bidders compete for the assignment of k slots. Each slot has an associate click-through rate, the click-through rates are decreasing from top to bottom. The GFP mechanism asks each bidder for a bid. Then the highest bidder gets the first slot, the second-highest, the second slot and so on. On each click the highest bidder pays his bid on the first slot, the second highest bidder pays his bid on the second slot, and so on.

In mechanism design, a Vickrey–Clarke–Groves (VCG) mechanism is a generic truthful mechanism for achieving a socially-optimal solution. It is a generalization of a Vickrey–Clarke–Groves auction. A VCG auction performs a specific task: dividing items among people. A VCG mechanism is more general: it can be used to select any outcome out of a set of possible outcomes.

A Bayesian-optimal mechanism (BOM) is a mechanism in which the designer does not know the valuations of the agents for whom the mechanism is designed, but the designer knows that they are random variables and knows the probability distribution of these variables.

Rental harmony is a kind of a fair division problem in which indivisible items and a fixed monetary cost have to be divided simultaneously. The housemates problem and room-assignment-rent-division are alternative names to the same problem.

<span class="mw-page-title-main">Price of anarchy in auctions</span>

The Price of Anarchy (PoA) is a concept in game theory and mechanism design that measures how the social welfare of a system degrades due to selfish behavior of its agents. It has been studied extensively in various contexts, particularly in auctions.

<span class="mw-page-title-main">Knapsack auction</span>

A knapsack auction is an auction in which several identical items are sold, and there are several bidders with different valuations interested in different amounts of items. The goal is to choose a subset of the bidders with a total demand, at most, the number of items and, subject to that, a maximum total value. Finding this set of bidders requires solving an instance of the knapsack problem, which explains the term "knapsack auction".

References

  1. Hal Varian, Christopher Harris. The VCG Auction in Theory and Practice, In The American Economic Review, Volume 104, Issue 5, pages 442-452. Elsevier B.V., 2014.
  2. Decarolis, Francesco; Rovigatti, Gabriele (July 2019). "From Mad Men to Maths Men: Concentration and Buyer Power in Online Advertising". CEPR Discussion Paper No. DP13897. SSRN   3428421 . Retrieved 2 August 2019.
  3. Decarolis, Francesco; Goldmanis, Maris; Penta, Antonio (2020). "Marketing Agencies and Collusive Bidding in Online Ad Auctions". Management Science. 66 (10): 4433–4454. doi:10.1287/mnsc.2019.3457. hdl: 10230/45339 . S2CID   216438141 . Retrieved 3 April 2020.
  4. Google AdWords, Check and understand Quality Score. support.google.com/adwords/answer/2454010