Vickrey–Clarke–Groves 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.[1] 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,[2] Edward H. Clarke,[3] and Theodore Groves[4] 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.[5]

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 ${\displaystyle M=\{t_{1},\ldots ,t_{m}\}}$ and any set of bidders ${\displaystyle N=\{b_{1},\ldots ,b_{n}\}}$, let ${\displaystyle V_{N}^{M}}$ 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 ${\displaystyle b_{i}}$ and item ${\displaystyle t_{j}}$, let the bidder's bid for the item be ${\displaystyle v_{i}(t_{j})}$. The notation ${\displaystyle A\setminus B}$ means the set of elements of A which are not elements of B.

Assignment

A bidder ${\displaystyle b_{i}}$ whose bid for an item ${\displaystyle t_{j}}$ is an "overbid", namely ${\displaystyle v_{i}(t_{j})}$, wins the item, but pays ${\displaystyle V_{N\setminus \{b_{i}\}}^{M}-V_{N\setminus \{b_{i}\}}^{M\setminus \{t_{j}\}}}$, 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 ${\displaystyle b_{i}}$ is ${\displaystyle N\setminus \{b_{i}\}}$. When item ${\displaystyle t_{j}}$ is available, they could attain welfare ${\displaystyle V_{N\setminus \{b_{i}\}}^{M}.}$ The winning of the item by ${\displaystyle b_{i}}$ reduces the set of available items to ${\displaystyle M\setminus \{t_{j}\}}$, however, so that the attainable welfare is now ${\displaystyle V_{N\setminus \{b_{i}\}}^{M\setminus \{t_{j}\}}}$. 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 ${\displaystyle b_{i}}$ got the item ${\displaystyle t_{j}}$. This quantity depends on the offers of the rest of the agents and is unknown to agent ${\displaystyle b_{i}}$.

Winner's utility

The winning bidder whose bid is the true value ${\displaystyle A}$ for the item ${\displaystyle t_{j}}$, ${\displaystyle v_{i}(t_{j})=A,}$ derives maximum utility ${\displaystyle A-\left(V_{N\setminus \{b_{i}\}}^{M}-V_{N\setminus \{b_{i}\}}^{M\setminus \{t_{j}\}}\right).}$

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, ${\displaystyle b_{1}}$ and ${\displaystyle b_{2}}$, two items, ${\displaystyle t_{1}}$ and ${\displaystyle t_{2}}$, and each bidder is allowed to obtain one item. We let ${\displaystyle v_{i,j}}$ be bidder ${\displaystyle b_{i}}$'s valuation for item ${\displaystyle t_{j}}$. Assume ${\displaystyle v_{1,1}=10}$, ${\displaystyle v_{1,2}=5}$, ${\displaystyle v_{2,1}=5}$, and ${\displaystyle v_{2,2}=3}$. We see that both ${\displaystyle b_{1}}$ and ${\displaystyle b_{2}}$ would prefer to receive item ${\displaystyle t_{1}}$; however, the socially optimal assignment gives item ${\displaystyle t_{1}}$ to bidder ${\displaystyle b_{1}}$ (so their achieved value is ${\displaystyle 10}$) and item ${\displaystyle t_{2}}$ to bidder ${\displaystyle b_{2}}$ (so their achieved value is ${\displaystyle 3}$). Hence, the total achieved value is ${\displaystyle 13}$, which is optimal.

If person ${\displaystyle b_{2}}$ were not in the auction, person ${\displaystyle b_{1}}$ would still be assigned to ${\displaystyle t_{1}}$, and hence person ${\displaystyle b_{1}}$ can gain nothing more. The current outcome is ${\displaystyle 10}$; hence ${\displaystyle b_{2}}$ is charged ${\displaystyle 10-10=0}$.

If person ${\displaystyle b_{1}}$ were not in the auction, ${\displaystyle t_{1}}$ would be assigned to ${\displaystyle b_{2}}$, and would have valuation ${\displaystyle 5}$. The current outcome is 3; hence ${\displaystyle b_{1}}$ is charged ${\displaystyle 5-3=2}$.

Example #3

A multiple item auction with ${\displaystyle n}$ bidders, ${\displaystyle n}$ houses, and values ${\displaystyle {\tilde {v}}_{ij}}$, representing the value player ${\displaystyle i}$ has for house ${\displaystyle j}$. 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 ${\displaystyle {\tilde {b}}_{ij}}$, asking each player ${\displaystyle i}$ how much they would wish to bid for house ${\displaystyle j}$. Define ${\displaystyle b_{i}(a)={\tilde {b}}_{ik}}$ if bidder ${\displaystyle i}$ receives house ${\displaystyle k}$ in the matching ${\displaystyle a}$. Now compute ${\displaystyle a^{*}}$, a maximum weight bipartite matching with respect to the bids, and compute

${\displaystyle p_{i}=\left[\max _{a\in A}\sum _{j\neq i}b_{j}(a)\right]-\sum _{j\neq i}b_{j}(a^{*})}$.

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

Optimality of truthful bidding

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

For each bidder ${\displaystyle b_{i}}$, let ${\displaystyle v_{i}}$ be their true valuation of an item ${\displaystyle t_{i}}$, and suppose (without loss of generality) that ${\displaystyle b_{i}}$ wins ${\displaystyle t_{i}}$ upon submitting their true valuations. Then the net utility ${\displaystyle U_{i}}$ attained by ${\displaystyle b_{i}}$ is given by their own valuation of the item they've won, minus the price they've paid:

${\displaystyle {\begin{aligned}U_{i}&=v_{i}-\left(V_{N\setminus \{b_{i}\}}^{M}-V_{N\setminus \{b_{i}\}}^{M\setminus \{t_{i}\}}\right)\\&=\sum _{j}v_{j}-\sum _{j\neq i}v_{j}+V_{N\setminus \{b_{i}\}}^{M\setminus \{t_{i}\}}-V_{N\setminus \{b_{i}\}}^{M}\\&=\sum _{j}v_{j}-V_{N\setminus \{b_{i}\}}^{M\setminus \{t_{i}\}}+V_{N\setminus \{b_{i}\}}^{M\setminus \{t_{i}\}}-V_{N\setminus \{b_{i}\}}^{M}\\&=\sum _{j}v_{j}-V_{N\setminus \{b_{i}\}.}^{M}\end{aligned}}}$

As ${\displaystyle V_{N\setminus \{b_{i}\}}^{M}}$ is independent of ${\displaystyle v_{i}}$, the maximization of net utility is pursued by the mechanism along with the maximization of corporate gross utility ${\displaystyle \sum _{j}v_{j}}$ for the declared bid ${\displaystyle v_{i}}$.

To make it clearer, let us form the difference ${\displaystyle U_{i}-U_{j}=\left[v_{i}+V_{N\setminus \{b_{i}\}}^{M\setminus \{t_{i}\}}\right]-\left[v_{j}+V_{N\setminus \{b_{i}\}}^{M\setminus \{t_{j}\}}\right]}$ between net utility ${\displaystyle U_{i}}$ of ${\displaystyle b_{i}}$ under truthful bidding ${\displaystyle v_{i}}$ gotten item ${\displaystyle t_{i}}$, and net utility ${\displaystyle U_{j}}$ of bidder ${\displaystyle b_{i}}$ under non-truthful bidding ${\displaystyle v'_{i}}$ for item ${\displaystyle t_{i}}$ gotten item ${\displaystyle t_{j}}$ on true utility ${\displaystyle v_{j}}$.

${\displaystyle \left[v_{j}+V_{N\setminus \{b_{i}\}}^{M\setminus \{t_{j}\}}\right]}$ is the corporate gross utility obtained with the non-truthful bidding. But the allocation assigning ${\displaystyle t_{j}}$ to ${\displaystyle b_{i}}$ is different from the allocation assigning ${\displaystyle t_{i}}$ to ${\displaystyle b_{i}}$ which gets maximum (true) gross corporate utility. Hence ${\displaystyle \left[v_{i}+V_{N\setminus \{b_{i}\}}^{M\setminus \{t_{i}\}}\right]-\left[v_{j}+V_{N\setminus \{b_{i}\}}^{M\setminus \{t_{j}\}}\right]\geq 0}$ and ${\displaystyle U_{i}\geq U_{j}}$ q.e.d.

See also

• Vickrey–Clarke–Groves mechanism
• Preference revelation

References

1. von Ahn, Luis (2011-10-13). "Sponsored Search" (PDF). 15–396: Science of the Web Course Notes. Carnegie Mellon University. Archived from the original (PDF) on 2015-03-06. Retrieved 2015-04-13.
2. Vickrey, William (1961). "Counterspeculation, Auctions, and Competitive Sealed Tenders". The Journal of Finance. 16 (1): 8–37. doi:10.1111/j.1540-6261.1961.tb02789.x.
3. Clarke, E. (1971). "Multipart Pricing of Public Goods". Public Choice. 11 (1): 17–33. doi:10.1007/bf01726210. S2CID 154860771.
4. Groves, T. (1973). "Incentives in Teams". Econometrica. 41 (4): 617–631. doi:10.2307/1914085. JSTOR 1914085.
5. Decarolis, Francesco; Goldmanis, Maris; Penta, Antonio. "Marketing agencies and collusive bidding in online ad auctions". National Bureau of Economic Research.
6. https://www.cs.cmu.edu/~arielpro/15896/docs/notes14.pdf