Question

HOMEWORK # 1 (for due date see web page) Consider a simultaneous two-player second-price auction concerning a single indivisible good. The game-frame is as follows: S S ($3, S4, $5, $6, $7 (these are the possible bids), the set of outcomes is the set of pairs (i, p) where ie1,2 is the winner of the auction and p is the price that winner has to pay and the outcome function is as follows (b denotes the bid of Player i): f(bb (2,b,) otherwise (a) Represent this game frame by means of a table (Player 1 chooses the row, Player 2 chooses the column and inside each cell you write the corresponding outcome) Player 1 values the object at S5, that is, he considers getting the object to be as good as getting $5. We shall consider two types preferences for Player 1 Case 1. Player 1 is selfish and uncaring. This means that (1) he prefers to get the object himself provided that he does not pay more than $4, (2) if he wins the auction then he prefers to pay less rather than more, (3) if he does not win the auction then he is indifferent as to how much Player 2 pays and (4) he is indifferent between winning the auction by paying $5 and not winning the auction. That is, for every p $5 and for every p,,p)(2, p), for every p and p, (1, p, p) if and only if p< p, for every p and p,(2, p)(2, p), for every p, (2, p), (1,S5), and everything that follows from transitivity (b) Use a utility function with values from the set 0,1,2,3,4) to represent the preferences of Player 1 and re-write the table of part (a) replacing outcomes with utilities for Player 1. (c) Is bidding his true value (namely $5) a weakly dominant strategy for Player 1? (d) How many weakly dominant strategies does Player 1 have?

0 0
Add a comment Improve this question Transcribed image text
Answer #1
part a
3 4 5 6 7

3

(1,3) 2,3 2,3 2,3 2,3
4 1,3 1,4 2,4 2,4 2,4
5 1,3 1,4 1,5 2,5 2,5
6 1,3 1,4 1,5 1,6 2,6
7 1,3 1,4 1,5 1,6 1,7
part b
3 4 5 6 7
3 1 0 0 0 0
4 2 1 0 0 0
5 0 0 0 0 0
6 0 0 0 0 0
7 0 0 0 0 0

Partc-Yes, bidding the true value is a weakly dominant strategy for player 1 as it is a second price auction. for the proof, refer Fudenberg Tirole Chapter 1

Add a comment
Know the answer?
Add Answer to:
HOMEWORK # 1 (for due date see web page) Consider a simultaneous two-player second-price auction concerning...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Second Price sealed bid-auction: Assume n players are bidding in an auction in order to obtain an...

    Second Price sealed bid-auction: Assume n players are bidding in an auction in order to obtain an indivisible object. Denote by vi the value player i attaches to the object; if she obtains the object at the price p her payoff is vi −p. Assume that the players’ valuations of the object are all different and all positive; number the players 1 through n in such a way that v1 > v2 > · · · > vn > 0....

  • 8. Consider the following simultaneous game (payoff pairs (a, b) indicate the payoffs to Player 1...

    8. Consider the following simultaneous game (payoff pairs (a, b) indicate the payoffs to Player 1 (a) and Player 2 (b), respectively) Player 1 CİD Player 2 C| (4,3) | (5-1) What dominant strategies, if any, does Player 1 have? A. C is strongly dominant B. D is strongly dominant C. C and D are both weakly dominant D. Player 1 has no dominant strategies E. Cannot determine without additional information 10. The Axiom of Distribution of Probabilities Across Alternatives...

  • 2. Consider the following sequential game. Player A can choose between two tasks, Tl and T2....

    2. Consider the following sequential game. Player A can choose between two tasks, Tl and T2. After having observed the choice of A, Player B chooses between two projects Pl or P2. The payoffs are as follows: If A chooses TI and B chooses P1 the payoffs are (12, 8), where the first payoff is for A and the second for B; if A chooses T1 and B opts for P2 the payoffs are (20, 7); if A chooses T2...

  • 2. Consider the following sequential game. Player A can choose between two tasks, TI and T2....

    2. Consider the following sequential game. Player A can choose between two tasks, TI and T2. After having observed the choice of A, Player B chooses between two projects P1 or P2. The payoffs are as follows: If A chooses TI and B chooses Pl the payoffs are (12.8), where the first payoff is for A and the second for B; if A chooses TI and B opts for P2 the payoffs are (20,7); if A chooses T2 and B...

  • A subtraction game Subtraction games are two-player games in which there is a pile of objects,...

    A subtraction game Subtraction games are two-player games in which there is a pile of objects, say coins. There are two players, Alice and Bob, who alternate turns subtracting 4.9. A SUBTRACTION GAME 19 from the pile some number of coins belonging to a set S (the subtraction set). Alice goes first. The first player who is unable to make a legal move loses. For example, suppose the initial pile contains 5 coins, and each player can, on his turn,...

  • 4. (a) (10%) A player has three information sets in the game tree. He has four...

    4. (a) (10%) A player has three information sets in the game tree. He has four choices in his first information set, four in his second and three in his third. How many strategies does he have in the strategic form? Circle one: (i) 11, (ii) 28 (iii) 48 (iv) 18. (b) (10%) Is it true that the following game is a Prisoners' Dilemma? Explain which features of a Prisoners' Dilemma hold and which do not. (Remember each player must...

  • 6. Consider a sequential game with 3 players. Player 1 can choose A or B. Player...

    6. Consider a sequential game with 3 players. Player 1 can choose A or B. Player 2 can choose C, D, E, or F (depending on what player 1 chooses). Player 3 can choose G, H, I, J, K, L, M, or N (depending on what player 1 and 2 choose). Player 1 (P1) goes first, player 2 (P2) goes second, and player 3 (P3) goes third. Payoffs are written as the payoffs for P1, P2, and the for P3....

  • Game Theory Eco 405 Homework 2 Due February 20, 2020 1. Find all the Nash equilibria...

    Game Theory Eco 405 Homework 2 Due February 20, 2020 1. Find all the Nash equilibria you can of the following game. LCDR T 0,1 4,2 1,1 3,1 M 3,3 0,6 1,2 -1,1 B 2.5 1.7 3.8 0.0 2. This question refers to a second-price, simultaneous bid auction with n > 1 bidders. Assume that the bidders' valuations are 1, ,... where > > ... > >0. Bidders simultaneously submit bids, and the winner is the one who has the...

  • usion (24 points) Two firms are playing a repeated Bertrand game infinitely, each with the same marginal cost 100. The market demand function is P-400-Q. The firm who charges the lower price win...

    usion (24 points) Two firms are playing a repeated Bertrand game infinitely, each with the same marginal cost 100. The market demand function is P-400-Q. The firm who charges the lower price wins the whole market. When both firms charge the same price, each gets 1/2 of the total market. I. Coll A. (6 points) What price will they choose in the stage (only one period) Nash equilibrium? What price will they choose if in the stage game (only one...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT