Problem 2 We consider a VCG auction with three biders, A, B, and C, and three objects 1, y, and z. Bidders' bids are given in Table 2. 1. Find the optimal assignment 2. Find the price paid by each bidder for his/her assignment. Note: going brute force by looking at all possible assigments is not the best way. With a little scrutiny you can see that some assignments are not worth looking at. Your answer should show how you find the optimal assignment and prices. 5 8 10 11 20 {y} 10 {xy} 25 0 B 10 2 7 3 9 10 12 10 10 20 12 30 30 25 0 0 Table 2: Bids Problem 2 We consider a VCG auction with three biders, A, B, and C, and three objects 1, y, and z. Bidders' bids are given in Table 2. 1. Find the optimal assignment 2. Find the price paid by each bidder for his/her assignment. Note: going brute force by looking at all possible assigments is not the best way. With a little scrutiny you can see that some assignments are not worth looking at. Your answer should show how you find the optimal assignment and prices. 5 8 10 11 20 {y} 10 {xy} 25 0 B 10 2 7 3 9 10 12 10 10 20 12 30 30 25 0 0 Table 2: Bids