Vickrey–Clarke–Groves auction

Short description: 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.

The auction is named after William Vickrey, Edward H. Clarke, and Theodore Groves for their papers that successively generalized the idea.

The VCG auction is a specific use of the more general VCG mechanism. While the VCG auction tries to make a socially optimal allocation of items, VCG mechanisms allow for the selection of a socially optimal outcome out of a set of possible outcomes. If collusion is likely to occur among bidders, the VCG outperforms the generalized second-price auction for both revenues produced for the seller and allocative efficiency.

Intuitive description

Consider an auction where a set of identical products are being sold. Bidders can take part in the auction by announcing the maximum price they are willing to pay to receive N products. Each buyer is allowed to declare more than one bid, since its willingness-to-pay per unit might be different depending on the total number of units it receives. Bidders cannot see other people's bids at any moment since they are sealed (only visible to the auction system). Once all the bids are made, the auction is closed.

All the possible combinations of bids are then considered by the auction system, and the one maximizing the total sum of bids is kept, with the condition that it does not exceed the total amount of products available and that at most one bid from each bidder can be used. Bidders who have made a successful bid then receive the product quantity specified in their bid. The price they pay in exchange, however, is not the amount they had bid initially but only the marginal harm their bid has caused to other bidders (which is at most as high as their original bid).

This marginal harm caused to other participants (i.e. the final price paid by each individual with a successful bid) can be calculated as: (sum of bids of the auction from the best combination of bids excluding the participant under consideration) − (what other winning bidders have bid in the current (best) combination of bids). If the sum of bids of the second best combination of bids is the same as that of the best combination, then the price paid by the buyers will be the same as their initial bid. In all other cases, the price paid by the buyers will be lower.

At the end of the auction, the total utility has been maximized since all the goods have been attributed to the people with the highest combined willingness-to-pay. If agents are fully rational and in the absence of collusion, we can assume that the willingness to pay have been reported truthfully since only the marginal harm to other bidders will be charged to each participant, making truthful reporting a weakly-dominant strategy. This type of auction, however, will not maximize the seller's revenue unless the sum of bids of the second best combination of bids is equal to the sum of bids of the best combination of bids.

Formal description

Notation

For any set of auctioned items [math]\displaystyle{ M = \{t_1,\ldots,t_m\} }[/math] and any set of bidders [math]\displaystyle{ N = \{b_1,\ldots,b_n\} }[/math], let [math]\displaystyle{ V^M_N }[/math] be the social value of the VCG auction for a given bid-combination. That is, how much each person values the items they've just won, added up across everyone. The value of the item is zero if they do not win. For a bidder [math]\displaystyle{ b_i }[/math] and item [math]\displaystyle{ t_j }[/math], let the bidder's bid for the item be [math]\displaystyle{ v_{i}(t_{j}) }[/math]. The notation [math]\displaystyle{ A \setminus B }[/math] means the set of elements of A which are not elements of B.

Assignment

A bidder [math]\displaystyle{ b_i }[/math] whose bid for an item [math]\displaystyle{ t_j }[/math] is an "overbid", namely [math]\displaystyle{ v_{i}(t_{j}) }[/math], wins the item, but pays [math]\displaystyle{ V^{M}_{N \setminus \{b_i\}}-V^{M \setminus \{t_j\}}_{N \setminus \{b_i\}} }[/math], which is the social cost of their winning that is incurred by the rest of the agents.

Explanation

Indeed, the set of bidders other than [math]\displaystyle{ b_i }[/math] is [math]\displaystyle{ N \setminus \{b_i\} }[/math]. When item [math]\displaystyle{ t_j }[/math] is available, they could attain welfare [math]\displaystyle{ V^{M}_{N \setminus \{b_i\}}. }[/math] The winning of the item by [math]\displaystyle{ b_i }[/math] reduces the set of available items to [math]\displaystyle{ M \setminus \{t_j\} }[/math], so the attainable welfare is now [math]\displaystyle{ V^{M \setminus \{t_j\}}_{N \setminus \{b_i\}} }[/math]. The difference between the two levels of welfare is therefore the loss in attainable welfare suffered by the rest of the bidders, as predicted, given the winner [math]\displaystyle{ b_i }[/math] got the item [math]\displaystyle{ t_j }[/math]. This quantity depends on the offers of the rest of the agents and is unknown to agent [math]\displaystyle{ b_i }[/math].

Winner's utility

The winning bidder whose bid is the true value [math]\displaystyle{ A }[/math] for the item [math]\displaystyle{ t_j }[/math], [math]\displaystyle{ v_{i}(t_{j})=A, }[/math] derives maximum utility [math]\displaystyle{ A - \left(V^{M}_{N \setminus \{b_i\}}-V^{M \setminus \{t_j\}}_{N \setminus \{b_i\}}\right). }[/math]

Examples

Two items, three bidders

Suppose two apples are being auctioned among three bidders.

• Bidder A wants one apple and is willing to pay $5 for that apple.
• Bidder B wants one apple and is willing to pay $2 for it.
• Bidder C wants two apples and is willing to pay $6 to have both of them but is uninterested in buying only one without the other.

First, the outcome of the auction is determined by maximizing bids: the apples go to bidder A and bidder B, since their combined bid of $5 + $2 = $7 is greater than the bid for two apples by bidder C who is willing to pay only $6. Thus, after the auction, the value achieved by bidder A is $5, by bidder B is $2, and by bidder C is $0 (since bidder C gets nothing). Note that the determination of winners is essentially a knapsack problem.

Next, the formula for deciding payments gives:

• For bidder A: The payment for winning required of A is determined as follows: First, in an auction that excludes bidder A, the social-welfare maximizing outcome would assign both apples to bidder C for a total social value of $6. Next, the total social value of the original auction excluding A's value is computed as $7 − $5 = $2. Finally, subtract the second value from the first value. Thus, the payment required of A is $6 − $2 = $4.
• For bidder B: Similar to the above, the best outcome for an auction that excludes bidder B assigns both apples to bidder C for $6. The total social value of the original auction minus B's portion is $5. Thus, the payment required of B is $6 − $5 = $1.
• Finally, the payment for bidder C is (($5 + $2) − ($5 + $2)) = $0.

After the auction, A is $1 better off than before (paying $4 to gain $5 of utility), B is $1 better off than before (paying $1 to gain $2 of utility), and C is neutral (having not won anything).

Two bidders

Assume that there are two bidders, [math]\displaystyle{ b_1 }[/math] and [math]\displaystyle{ b_2 }[/math], two items, [math]\displaystyle{ t_1 }[/math] and [math]\displaystyle{ t_2 }[/math], and each bidder is allowed to obtain one item. We let [math]\displaystyle{ v_{i,j} }[/math] be bidder [math]\displaystyle{ b_i }[/math]'s valuation for item [math]\displaystyle{ t_j }[/math]. Assume [math]\displaystyle{ v_{1,1} = 10 }[/math], [math]\displaystyle{ v_{1,2} = 5 }[/math], [math]\displaystyle{ v_{2,1} = 5 }[/math], and [math]\displaystyle{ v_{2,2} = 3 }[/math]. We see that both [math]\displaystyle{ b_1 }[/math] and [math]\displaystyle{ b_2 }[/math] would prefer to receive item [math]\displaystyle{ t_1 }[/math]; however, the socially optimal assignment gives item [math]\displaystyle{ t_1 }[/math] to bidder [math]\displaystyle{ b_1 }[/math] (so their achieved value is [math]\displaystyle{ 10 }[/math]) and item [math]\displaystyle{ t_2 }[/math] to bidder [math]\displaystyle{ b_2 }[/math] (so their achieved value is [math]\displaystyle{ 3 }[/math]). Hence, the total achieved value is [math]\displaystyle{ 13 }[/math], which is optimal.

If person [math]\displaystyle{ b_2 }[/math] were not in the auction, person [math]\displaystyle{ b_1 }[/math] would still be assigned to [math]\displaystyle{ t_1 }[/math], and hence person [math]\displaystyle{ b_1 }[/math] can gain nothing more. The current outcome is [math]\displaystyle{ 10 }[/math]; hence [math]\displaystyle{ b_2 }[/math] is charged [math]\displaystyle{ 10-10=0 }[/math].

If person [math]\displaystyle{ b_1 }[/math] were not in the auction, [math]\displaystyle{ t_1 }[/math] would be assigned to [math]\displaystyle{ b_2 }[/math], and would have valuation [math]\displaystyle{ 5 }[/math]. The current outcome is 3; hence [math]\displaystyle{ b_1 }[/math] is charged [math]\displaystyle{ 5-3=2 }[/math].

Example #3

Consider an auction of [math]\displaystyle{ n }[/math] houses to [math]\displaystyle{ n }[/math] bidders, who are to each receive a house. [math]\displaystyle{ \tilde v_{ij} }[/math], represents the value player [math]\displaystyle{ i }[/math] has for house [math]\displaystyle{ j }[/math]. Possible outcomes are characterized by bipartite matchings pairing houses with people. If we know the values, then maximizing social welfare reduces to computing a maximum weight bipartite matching.

If we do not know the values, then we instead solicit bids [math]\displaystyle{ \tilde b_{ij} }[/math], asking each player [math]\displaystyle{ i }[/math] how much they would wish to bid for house [math]\displaystyle{ j }[/math]. Define [math]\displaystyle{ b_i(a) = \tilde b_{ik} }[/math] if bidder [math]\displaystyle{ i }[/math] receives house [math]\displaystyle{ k }[/math] in the matching [math]\displaystyle{ a }[/math]. Now compute [math]\displaystyle{ a^* }[/math], a maximum weight bipartite matching with respect to the bids, and compute

[math]\displaystyle{ p_i = \left[ \max_{a \in A} \sum_{j \neq i} b_j(a) \right] - \sum_{j \neq i} b_j(a^*) }[/math].

The first term is another max weight bipartite matching, and the second term can be computed easily from [math]\displaystyle{ a^* }[/math].

Optimality of truthful bidding

The following is a proof that bidding one's true valuations for the auctioned items is optimal.

For each bidder [math]\displaystyle{ b_i }[/math], let [math]\displaystyle{ v_i }[/math] be their true valuation of an item [math]\displaystyle{ t_i }[/math], and suppose (without loss of generality) that [math]\displaystyle{ b_i }[/math] wins [math]\displaystyle{ t_i }[/math] upon submitting their true valuations. Then the net utility [math]\displaystyle{ U_i }[/math] attained by [math]\displaystyle{ b_i }[/math] is given by their own valuation of the item they've won, minus the price they've paid:

[math]\displaystyle{ \begin{align} U_i &= v_i-\left(V^{M}_{N \setminus \{b_i\}}-V^{M \setminus \{t_i\}}_{N \setminus \{b_i\}}\right) \\ &=\sum_{j}v_j-\sum_{j\neq i}v_j+V^{M\setminus \{t_i\}}_{N\setminus \{b_i\}}-V^M_{N\setminus\{b_i\}} \\ &=\sum_j v_j-V^{M\setminus \{t_i\}}_{N\setminus \{b_i\}}+V^{M\setminus \{t_i\}}_{N\setminus \{b_i\}}-V^M_{N\setminus\{b_i\}} \\ &=\sum_j v_j-V^M_{N\setminus\{b_i\}.} \end{align} }[/math]

As [math]\displaystyle{ V^M_{N\setminus\{b_i\}} }[/math] is independent of [math]\displaystyle{ v_i }[/math], the maximization of net utility is pursued by the mechanism along with the maximization of corporate gross utility [math]\displaystyle{ \sum_j v_j }[/math] for the declared bid [math]\displaystyle{ v_i }[/math].

To make it clearer, let us form the difference [math]\displaystyle{ U_i - U_j = \left[v_i + V^{M \setminus \{t_i\}}_{N \setminus \{b_i\}}\right] - \left[v_j + V^{M \setminus \{t_j\}}_{N \setminus \{b_i\}}\right] }[/math] between net utility [math]\displaystyle{ U_i }[/math] of [math]\displaystyle{ b_i }[/math] under truthful bidding [math]\displaystyle{ v_i }[/math] gotten item [math]\displaystyle{ t_i }[/math], and net utility [math]\displaystyle{ U_j }[/math] of bidder [math]\displaystyle{ b_i }[/math] under non-truthful bidding [math]\displaystyle{ v'_i }[/math] for item [math]\displaystyle{ t_i }[/math] gotten item [math]\displaystyle{ t_j }[/math] on true utility [math]\displaystyle{ v_j }[/math].

[math]\displaystyle{ \left[v_j + V^{M \setminus \{t_j\}}_{N \setminus \{b_i\}}\right] }[/math] is the corporate gross utility obtained with the non-truthful bidding. But the allocation assigning [math]\displaystyle{ t_j }[/math] to [math]\displaystyle{ b_i }[/math] is different from the allocation assigning [math]\displaystyle{ t_i }[/math] to [math]\displaystyle{ b_i }[/math] which gets maximum (true) gross corporate utility. Hence [math]\displaystyle{ \left[v_i + V^{M \setminus \{t_i\}}_{N \setminus \{b_i\}}\right] - \left[v_j + V^{M \setminus \{t_j\}}_{N \setminus \{b_i\}}\right]\geq 0 }[/math] and [math]\displaystyle{ U_i\geq U_j }[/math] q.e.d.

See also

• Vickrey–Clarke–Groves mechanism
• Vickrey auction
• Preference revelation