Misplaced Pages

Vickrey–Clarke–Groves auction

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.

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.

#512487

46-457: 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

92-433: A ) = b ~ i k {\displaystyle b_{i}(a)={\tilde {b}}_{ik}} if bidder i {\displaystyle i} receives house k {\displaystyle k} in the matching a {\displaystyle a} . Now compute a ∗ {\displaystyle a^{*}} , a maximum weight bipartite matching with respect to

138-593: A knapsack problem . Next, the formula for deciding payments gives: 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). Assume that there are two bidders, b 1 {\displaystyle b_{1}} and b 2 {\displaystyle b_{2}} , two items, t 1 {\displaystyle t_{1}} and t 2 {\displaystyle t_{2}} , and each bidder

184-500: A 500-page dissertation entitle "An Agenda for Progressive Taxation." Vickrey's doctoral work was interrupted by World War II , when he was enlisted to work for the U.S. National Resources Planning Board and later the Treasury Department 's Division of Tax Research. Vickrey remained at Columbia for his entire career. His students included the economists Jacques Drèze , Harvey J. Levin , and Lynn Turgeon. Vickrey

230-419: A given set U , the absolute complement of A is the set of elements in U that are not in A . The relative complement of A with respect to a set B , also termed the set difference of B and A , written B ∖ A , {\displaystyle B\setminus A,} is the set of elements in B that are not in A . If A is a set, then the absolute complement of A (or simply

276-428: 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

322-756: A theorist’s applied economist.” Vickrey was awarded the 1996 Nobel Memorial Prize in Economic Sciences with James Mirrlees for their research into the economic theory of incentives under asymmetric information . Vickrey never personally received the Prize; it was announced just three days prior to his death. Vickrey was born in Victoria, British Columbia to Charles Vernon Vickrey, a Congregationalist minister, and Ada Eliza Spencer. The family moved to New York City in William's childhood, where his father

368-867: A universe U . The following identities capture notable properties of relative complements: A binary relation R {\displaystyle R} is defined as a subset of a product of sets X × Y . {\displaystyle X\times Y.} The complementary relation R ¯ {\displaystyle {\bar {R}}} is the set complement of R {\displaystyle R} in X × Y . {\displaystyle X\times Y.} The complement of relation R {\displaystyle R} can be written R ¯   =   ( X × Y ) ∖ R . {\displaystyle {\bar {R}}\ =\ (X\times Y)\setminus R.} Here, R {\displaystyle R}

414-456: A universe U . The following identities capture important properties of absolute complements: De Morgan's laws : Complement laws: Involution or double complement law: Relationships between relative and absolute complements: Relationship with a set difference: The first two complement laws above show that if A is a non-empty, proper subset of U , then { A , A } is a partition of U . If A and B are sets, then

460-650: 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. For any set of auctioned items M = { t 1 , … , t m } {\displaystyle M=\{t_{1},\ldots ,t_{m}\}} and any set of bidders N = { b 1 , … , b n } {\displaystyle N=\{b_{1},\ldots ,b_{n}\}} , let V N M {\displaystyle V_{N}^{M}} be

506-554: Is 10 {\displaystyle 10} ; hence b 2 {\displaystyle b_{2}} is charged 10 − 10 = 0 {\displaystyle 10-10=0} . If person b 1 {\displaystyle b_{1}} were not in the auction, t 1 {\displaystyle t_{1}} would be assigned to b 2 {\displaystyle b_{2}} , and would have valuation 5 {\displaystyle 5} . The current outcome

SECTION 10

#1732787580513

552-536: Is 3 {\displaystyle 3} ). Hence, the total achieved value is 13 {\displaystyle 13} , which is optimal. If person b 2 {\displaystyle b_{2}} were not in the auction, person b 1 {\displaystyle b_{1}} would still be assigned to t 1 {\displaystyle t_{1}} , and hence person b 1 {\displaystyle b_{1}} can gain nothing more. The current outcome

598-450: Is 3; hence b 1 {\displaystyle b_{1}} is charged 5 − 3 = 2 {\displaystyle 5-3=2} . Consider an auction of n {\displaystyle n} houses to n {\displaystyle n} bidders, who are to each receive a house. v ~ i j {\displaystyle {\tilde {v}}_{ij}} , represents

644-884: Is allowed to obtain one item. We let v i , j {\displaystyle v_{i,j}} be bidder b i {\displaystyle b_{i}} 's valuation for item t j {\displaystyle t_{j}} . Assume v 1 , 1 = 10 {\displaystyle v_{1,1}=10} , v 1 , 2 = 5 {\displaystyle v_{1,2}=5} , v 2 , 1 = 5 {\displaystyle v_{2,1}=5} , and v 2 , 2 = 3 {\displaystyle v_{2,2}=3} . We see that both b 1 {\displaystyle b_{1}} and b 2 {\displaystyle b_{2}} would prefer to receive item t 1 {\displaystyle t_{1}} ; however,

690-561: Is ambiguous, as in some contexts (for example, Minkowski set operations in functional analysis ) it can be interpreted as the set of all elements b − a , {\displaystyle b-a,} where b is taken from B and a from A . Formally: B ∖ A = { x ∈ B : x ∉ A } . {\displaystyle B\setminus A=\{x\in B:x\notin A\}.} Let A , B , and C be three sets in

736-473: Is likely to occur among bidders, the VCG outperforms the generalized second-price auction for both revenues produced for the seller and allocative efficiency. 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

782-420: Is often viewed as a logical matrix with rows representing the elements of X , {\displaystyle X,} and columns elements of Y . {\displaystyle Y.} The truth of a R b {\displaystyle aRb} corresponds to 1 in row a , {\displaystyle a,} column b . {\displaystyle b.} Producing

828-1169: Is the corporate gross utility obtained with the non-truthful bidding. But the allocation assigning t j {\displaystyle t_{j}} to b i {\displaystyle b_{i}} is different from the allocation assigning t i {\displaystyle t_{i}} to b i {\displaystyle b_{i}} which gets maximum (true) gross corporate utility. Hence [ v i + V N ∖ { b i } M ∖ { t i } ] − [ v j + V N ∖ { b i } M ∖ { t j } ] ≥ 0 {\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 U i ≥ U j {\displaystyle U_{i}\geq U_{j}} q.e.d. William Vickrey William Spencer Vickrey (21 June 1914 – 11 October 1996)

874-562: Is the social cost of their winning that is incurred by the rest of the agents. Indeed, the set of bidders other than b i {\displaystyle b_{i}} is N ∖ { b i } {\displaystyle N\setminus \{b_{i}\}} . When item t j {\displaystyle t_{j}} is available, they could attain welfare V N ∖ { b i } M . {\displaystyle V_{N\setminus \{b_{i}\}}^{M}.} The winning of

920-715: Is the true value A {\displaystyle A} for the item t j {\displaystyle t_{j}} , v i ( t j ) = A , {\displaystyle v_{i}(t_{j})=A,} derives maximum utility A − ( V N ∖ { b i } M − V N ∖ { b i } M ∖ { t j } ) . {\displaystyle A-\left(V_{N\setminus \{b_{i}\}}^{M}-V_{N\setminus \{b_{i}\}}^{M\setminus \{t_{j}\}}\right).} Suppose two apples are being auctioned among three bidders. First,

966-447: Is usually denoted by A ∁ {\displaystyle A^{\complement }} . Other notations include A ¯ , A ′ , {\displaystyle {\overline {A}},A',} ∁ U A ,  and  ∁ A . {\displaystyle \complement _{U}A,{\text{ and }}\complement A.} Let A and B be two sets in

SECTION 20

#1732787580513

1012-661: Is usually used for rendering a set difference symbol, which is similar to a backslash symbol. When rendered, the \setminus command looks identical to \backslash , except that it has a little more space in front and behind the slash, akin to the LaTeX sequence \mathbin{\backslash} . A variant \smallsetminus is available in the amssymb package, but this symbol is not included separately in Unicode. The symbol ∁ {\displaystyle \complement } (as opposed to C {\displaystyle C} )

1058-685: The complement of A ) is the set of elements not in A (within a larger set that is implicitly defined). In other words, let U be a set that contains all the elements under study; if there is no need to mention U , either because it has been previously specified, or it is obvious and unique, then the absolute complement of A is the relative complement of A in U : A ∁ = U ∖ A = { x ∈ U : x ∉ A } . {\displaystyle A^{\complement }=U\setminus A=\{x\in U:x\notin A\}.} The absolute complement of A

1104-868: The land value tax was necessary to efficiently fund city services. He wrote that replacing taxes on production and labor ("including property taxes on improvements") with fees for holding valuable land sites "would substantially improve the economic efficiency of the jurisdiction". Vickrey further argued that land value tax had no adverse effects and that replacing existing taxes in this way would increase local productivity enough that land prices would rise instead of fall. He also made an ethical argument for Georgist value capture , noting that owners of valuable locations still take (exclude others from) local public goods, even if they choose not to use them, so without land value tax, land users have to pay twice for those public services (once in tax to government and once in rent to holders of land title). Vickrey's economic philosophy

1150-480: The relative complement of A in B , also termed the set difference of B and A , is the set of elements in B but not in A . The relative complement of A in B is denoted B ∖ A {\displaystyle B\setminus A} according to the ISO 31-11 standard . It is sometimes written B − A , {\displaystyle B-A,} but this notation

1196-674: The set of elements of A which are not elements of B . A bidder b i {\displaystyle b_{i}} whose bid for an item t j {\displaystyle t_{j}} is an "overbid", namely v i ( t j ) {\displaystyle v_{i}(t_{j})} , wins the item, but pays V N ∖ { b i } M − V N ∖ { b i } M ∖ { t j } {\displaystyle V_{N\setminus \{b_{i}\}}^{M}-V_{N\setminus \{b_{i}\}}^{M\setminus \{t_{j}\}}} , which

1242-424: 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

1288-769: The bids, and compute The first term is another max weight bipartite matching, and the second term can be computed easily from a ∗ {\displaystyle a^{*}} . The following is a proof that bidding one's true valuations for the auctioned items is optimal. For each bidder b i {\displaystyle b_{i}} , let v i {\displaystyle v_{i}} be their true valuation of an item t i {\displaystyle t_{i}} , and suppose ( without loss of generality ) that b i {\displaystyle b_{i}} wins t i {\displaystyle t_{i}} upon submitting their true valuations. Then

1334-472: The complementary relation to R {\displaystyle R} then corresponds to switching all 1s to 0s, and 0s to 1s for the logical matrix of the complement. Together with composition of relations and converse relations , complementary relations and the algebra of sets are the elementary operations of the calculus of relations . In the LaTeX typesetting language, the command \setminus

1380-725: The costs that arise from the service being fully used when there is still demand. Congestion pricing gives a signal to users to adjust their behavior or to investors to expand the service in order to remove the constraint. The theory was later partially put into action in London . In public economics , Vickrey extended the marginal cost pricing approach of Harold Hotelling and showed how public goods should be provided at marginal cost. He contended that efficient funding for public utilities and transportation systems required short-run marginal pricing, or pricing responsive to current demand. Alongside marginal cost pricing, Vickrey argued that

1426-405: 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

Vickrey–Clarke–Groves auction - Misplaced Pages Continue

1472-472: The item by b i {\displaystyle b_{i}} reduces the set of available items to M ∖ { t j } {\displaystyle M\setminus \{t_{j}\}} , so the attainable welfare is now V N ∖ { b i } M ∖ { t j } {\displaystyle V_{N\setminus \{b_{i}\}}^{M\setminus \{t_{j}\}}} . The difference between

1518-1941: The maximization of net utility is pursued by the mechanism along with the maximization of corporate gross utility ∑ j v j {\displaystyle \sum _{j}v_{j}} for the declared bid v i {\displaystyle v_{i}} . To make it clearer, let us form the difference U i − U j = [ v i + V N ∖ { b i } M ∖ { t i } ] − [ v j + V N ∖ { b i } M ∖ { t j } ] {\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 U i {\displaystyle U_{i}} of b i {\displaystyle b_{i}} under truthful bidding v i {\displaystyle v_{i}} gotten item t i {\displaystyle t_{i}} , and net utility U j {\displaystyle U_{j}} of bidder b i {\displaystyle b_{i}} under non-truthful bidding v i ′ {\displaystyle v'_{i}} for item t i {\displaystyle t_{i}} gotten item t j {\displaystyle t_{j}} on true utility v j {\displaystyle v_{j}} . [ v j + V N ∖ { b i } M ∖ { t j } ] {\displaystyle \left[v_{j}+V_{N\setminus \{b_{i}\}}^{M\setminus \{t_{j}\}}\right]}

1564-464: The net utility U i {\displaystyle U_{i}} attained by b i {\displaystyle b_{i}} is given by their own valuation of the item they've won, minus the price they've paid: As V N ∖ { b i } M {\displaystyle V_{N\setminus \{b_{i}\}}^{M}} is independent of v i {\displaystyle v_{i}} ,

1610-610: The only Nobel laureate born in British Columbia . Vickrey died three days later while traveling to a conference of Georgist academics that he helped found. His Columbia University economics department colleague C. Lowell Harriss accepted the posthumous prize on his behalf. There are only three other cases where a Nobel Prize has been presented posthumously: Erik Axel Karlfeldt (Literature 1931), Dag Hammarskjöld (Peace 1961) and Ralph Steinman (Physiology or Medicine 2011). Vickrey married Cecile Thompson in 1951. He

1656-412: 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

1702-584: 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 b i {\displaystyle b_{i}} and item t j {\displaystyle t_{j}} , let the bidder's bid for the item be v i ( t j ) {\displaystyle v_{i}(t_{j})} . The notation A ∖ B {\displaystyle A\setminus B} means

1748-425: The socially optimal assignment gives item t 1 {\displaystyle t_{1}} to bidder b 1 {\displaystyle b_{1}} (so their achieved value is 10 {\displaystyle 10} ) and item t 2 {\displaystyle t_{2}} to bidder b 2 {\displaystyle b_{2}} (so their achieved value

1794-498: 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

1840-461: The two levels of welfare is therefore the loss in attainable welfare suffered by the rest of the bidders, as predicted, given the winner b i {\displaystyle b_{i}} got the item t j {\displaystyle t_{j}} . This quantity depends on the offers of the rest of the agents and is unknown to agent b i {\displaystyle b_{i}} . The winning bidder whose bid

1886-683: The value player i {\displaystyle i} has for house j {\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 b ~ i j {\displaystyle {\tilde {b}}_{ij}} , asking each player i {\displaystyle i} how much they would wish to bid for house j {\displaystyle j} . Define b i (

Vickrey–Clarke–Groves auction - Misplaced Pages Continue

1932-613: Was General Secretary of the American Committee for Armenian and Syrian Relief , one of the nation's first humanitarian assistance organizations. Vickrey attended high school at Phillips Academy in Andover, Massachusetts . After obtaining his B.S. in Mathematics at Yale University in 1935, he went on to complete his M.A. at Columbia University in 1937. He stayed at Columbia for a PhD , which he completed 1948 with

1978-526: Was a Quaker and a member of Scarsdale Friends Meeting . He died in Harrison, New York in 1996 from heart failure. Set-theoretic difference In set theory , the complement of a set A , often denoted by A ∁ {\displaystyle A^{\complement }} (or A ′ ), is the set of elements not in A . When all elements in the universe , i.e. all elements under consideration, are considered to be members of

2024-566: Was a Canadian-American professor of economics and Nobel Laureate . He was a lifelong faculty member at Columbia University . A theorist who worked on public economics and mechanism design, Vickrey primarily discussed public policy problems. He originated the Vickrey auction , introduced the concept of congestion pricing in networks, formalized arguments for marginal cost pricing , and contributed to optimal income taxation. James Tobin described him as "an applied economist’s theorist, as well as

2070-605: Was influenced by John Maynard Keynes and Henry George . He was sharply critical of the Chicago school of economics and was vocal in opposing the political focus on achieving balanced budgets and fighting inflation , especially in times of high unemployment . Working under General MacArthur , Vickrey helped accomplish radical land reform in Japan. Vickrey's Nobel Prize in Economics was announced on October 8, 1996. He became

2116-448: Was the first to use the tools of game theory to explain the dynamics of auctions . In his seminal paper, Vickrey derived several auction equilibria, and provided an early revenue-equivalence result. The revenue equivalence theorem remains the centrepiece of modern auction theory. The Vickrey auction is named after him. Vickrey worked on congestion pricing , the notion that roads and other services should be priced so that users see

#512487