# Suppose that a seller has one item which we will call item x. There are three buyers whom we will.

Suppose that a seller has one item, which we will call item x. There are three buyers, whom we will call A, B, and C. The values that these buyers (A, B, and C) have for the item are 6, 3, and 1, respectively.
(a) Suppose that the seller runs a second price auction for the item. Which buyer will win the auction and how much will this buyer pay? Make it clear what are the bids.

(b) Now let us suppose that the seller uses the VCG procedure to allocate the item. Remember that the ﬁrst step in running the VCG procedure when there are more buyers than items is to create ﬁctional items, which each buyer values at 0, so that the number of items to be allocated is the same as the number of bidders. Let us call these additional (ﬁctional) items y and z.

i. Find the allocation that results from running the VCG procedure.

ii. What are the prices charged to each buyer for the item that they receive?

iii. Explain why the price that buyer A pays is the harm that he causes to the remaining bidders by taking the item he is assigned.

This is the Network Structure Problem, is there someone to help me on this problem? 