FINAL EXAM, Econ 171, March, 2015, with answers
|
|
|
- Brook Freeman
- 10 years ago
- Views:
Transcription
1 FINAL EXAM, Econ 171, March, 2015, with answers There are 9 questions. Answer any 8 of them. Good luck! Problem 1. (True or False) If a player has a dominant strategy in a simultaneous-move game, then she is sure to get her best possible outcome in any Nash equilibrium of the game. Explain your answer and give an example of a game that illustrates your answer. This is false. Consider the game Prisoners Dilemma. In this game, Defect is a dominant strategy for both players. The best possible outcome for either player is for this player to Defect and the other player to cooperate. But this outcome is not a Nash equilibrium. The only Nash equilibrium is one in which both defect. The payo for a game depends on the actions of all players, so playing a dominant strategy does not guarantee a player his best possible outcome because the Nash equilibrium because the best outcome for Player 1 may occur only if Player 2 plays something that is not a best response for Player 2. Problem 2. Consider the game represented in the table below, where Player 1 chooses the row and Player 2 chooses the column. Table 1: A game of Chicken Swerve Don t Swerve Swerve 0,0-1,1 Don t Swerve T,-1-2,-2 A) Find all of the pure strategy Nash equilibrium strategy profiles for this game if T>0. There are two pure strategy Nash equilibria. In one of them Player 1 Swerves and Player 2 does not. In the other, Player 2 swerves and Player 1 does not. B) Find all of the pure strategy Nash equilibrium profiles for this game if T<0. In this case, Swerve is a dominant strategy for Player 1 and the only Nash equilibrium is one in which Player 1 swerves and Player 2 does not swerver. C) If T>0, there is a mixed strategy Nash equilibrium strategy profile that is not a pure strategy Nash equilibrium. Find it and find the payo s to each player in this equilibrium. In the mixed strategy Nash equilibrium, Player 2 swerves with probability 1/(1 + T ) and Player 1 swerves with probability 1/2. 1
2 D) In a mixed strategy Nash equilibrium with T = 2, which player is more likely to swerve? If T = 2, which player gets the higher expected payo in equilibrium? Which player s equilibrium mixed strategy depends on T. Player 1 is more likely to swerve. (He swerves with probability 1/2, while Player 2 swerves with probability 1/3.) Player 2 gets the higher expected payo. (His expected payo is -1/2. Player 1 s expected payo is -2/3.) E) (extra credit) Is there anything paradoxical about the results in Parts B and C? If so, what? If T > 1, Player 2 puts a higher value on winning the chicken game than Player 1. But it turns out that in the Nash equilibrium, the Player who cares less about winning plays the more aggressive strategy and in equilibrium has higher expected winnings.it works out this way because in a mixed strategy Nash equilibrium, each player s mixed strategy has to make the other player indi erent between the two pure strategies. Since Player 2 s payo does not change as T changes, Player 1 does not change his equilibrium mixed strategy. As T increases, Player 2 needs to increase the probability of not swerving in order for Player 1 to remain indi erent. Problem 3. An embezzler wants to hide some stolen money. An inspector is looking for the stolen money. There are two places that the embezzler can put the money. One place is di cult to access and one is easy to access. The inspector only has time to look in one of the two places. It is more costly to hide the money in the di cult place than in the easy place and also more costly for the inspector to look in the di cult place than in the easy case. The payo s are as follows. If the embezzler hides the money in the di cult place and the inspector looks in the di cult place, the payo is 0 for the embezzler and 2 for the inspector. If the embezzler hides the money in the di cult place and the inspector looks in the easy place, the payo is 2 for the embezzler and 1 for the inspector. If the embezzler hides the money in the easy place and the inspector looks in the di cult place, the payo is 3 for the embezzler and 0 for the inspector. If the embezzler hides the money in the easy place and the inspector looks in the easy place, the payo is 1 for the embezzler and 3 for the inspector. A) (True or false. Justify your answer. ) If the inspector believes that the embezzler randomizes in choosing his hiding place and hides the money in the 2
3 hard place with probability 2/3, the inspector will maximize his expected payo by looking in the hard place with probability 2/3. This is false. The pure strategy look in the easy place is the best response to this strategy by the embezzler. This pure strategy has a higher expected payo than the strategy of looking in the hard place with probability 2/3. If the embezzler hides the money in the hard place with probability 2/3, then the expected payo to the inspector from looking in the hard place is =4/3 and the expected payo to the inspector from looking in the easy place is =5/3. If the inspector looked in the hard place with probability 2/3, his expected payo would be = 13 9 < 5/3. B) Find a Nash equilibrium in mixed strategies for this game. In the mixed strategy Nash equilibrium, the embezzler hides the money in the di cult place with probability 3/4 and in the easy place with probability 1/4. The inspector looks in the di cult place with probability 1/4 and in the easy place with probability 3/4. C) In Nash equilibrium: What is the expected payo for the embezzler? What is the expected payo for the inspector? What is the probability that the inspector finds the money? The expected payo for each of them is 3/2. The probability that the inspector finds the money is 3/8. Problem 4. Alice and Bob have di ering tastes in movies, but they like to be together. There are two movies in town, Movie A and Movie B. Alice gets a payo of 3 if she and Bob both go to Movie A. She gets a payo of 2 if she and Bob both go to Movie B. She gets a payo of 1 if she goes to Movie A and Bob goes to B. She gets a payo of 0 if she goes to Movie B and Bob goes to Movie A. Bob gets a payo of 3 if he and Alice both go to B. He gets a payo of 2 if they both go to movie A. His payo is 1 if he goes to B and Alice goes to A. His payo is 0 if he goes to A and she goes to B. The last time they met, Alice and Bob agreed to go to a movie, but they didn t get around to deciding each one. Each of them knows the other s payo s from the various outcomes. They have no way of communicating before the movie, and so they must make their choices simultaneously, without knowing the other s choice. A) Show this game in strategic form. Find a mixed strategy Nash equilibrium in which each of them has a positive probability of going to each of the movies. What is the expected payo to each player in this mixed strategy Nash equilibrium? In the strategic form is shown here, Alice chooses the row and Bob chooses the column. 3
4 Table 2: Movie Game Bob goes to A Bob goes to B Alice goes to A 3,2 1,1 Alice goes to B 0,0 2,3 In the mixed strategy equilibrium for this game, Alice goes to Movie A with probability 3/4 and to Movie B with probability 1/4. Bob goes to Movie A with probability 1/4 and to B with probability 3/4. The equilibrium expected payo to each of them is 3/2. B) Suppose that the situation is as described above, except that Alice s desire to go to Movie A is stronger. For some T such that 0 <T <1, Alice s payo is 3+T if she goes to movie A and Bob goes there too. Her payo is 1+T if she goes to Movie A and Bob goes to Movie B. All other payo s are the same as described above. In the mixed strategy equilibrium of this game, does the probability that Alice goes to Movie A increase or decrease as T increases? Does the probability that Bob goes to Movie A increase or decrease as T increases? Does Alice s expected payo in this mixed strategy equilibrium increase or decrease as T increases over the range between 0 and 1? What happens to Bob s expected payo as T increases over this range? The probability that Alice goes to A does not change. The probability that Bob goes to A decreases. Alice s expected payo increases as T increases. Bob s expected payo does not change. In the mixed strategy Nash equilibrium where 0 <T <1, Bob goes to movie A with probability (1 T )/4 and to Movie B with probability (3 + T )/4, while Alice goes to Movie A with probability 3/4 and B with probability 1/4. Alice s payo expected payo is (3 + T )/2. C) Suppose that payo s are as in part B, but with T>1. Find all of the Nash equilibria in pure and or mixed strategies for this game. The only Nash equilibrium is one in which Alice goes to A and Bob goes to A. In this case, going to A is a dominant strategy for Alice. D) (extra credit) Try to give a convincing argument for each of your answers in Part B, without explicitly calculating the equilibrium mixed strategies. em In the mixed strategy equilibrium, Bob s strategy must make Alice indi erent between going to A and going to B. Movie A is more attractive to Alice, the more likely Bob is to be there. As T gets larger, in order to keep Alice indi erent, Bob would have to be less likely to go to A. Since Bob s payo s do 4
5 not change as T changes, the equilibrium probabilities of Alice going to A can not change. In equilibrium, Alice has to be indi erent between going to A and going to B. Since Bob is more likely to be at B when T increases, going to B must be more attractive to Alice when T increases. So it must be that in equilibrium, both pure strategies as well as all mixed strategies must give Alice a higher payo as T increases. Since Alice does not change her probabilitiies as T increases, the payo to both pure strategies and to all mixed strategies stays the same for Bob. Problem 5. The duchess and the countess are invited to a ball. Each of them has two dresses suitable for the ball, a stunning red dress and a charming blue dress. Unfortunately, they have the same dress designer, and their dresses are duplicates. Both would be embarrassed if they wore identical dresses to the ball. Each of them prefers her red dress to her blue dress, but would rather wear the blue dress if the other is wearing the red dress. The duchess and the countess do not speak to each other and must decide on which dress to wear, without knowing what the other is wearing. If both wear the same color of dress, they both get payo s of zero. If one wears red and the other wears blue, the one who wears red gets a payo of 2 and the one who wears blue gets a payo of 1. A) Show the game played between the countess and the duchess in strategic form. Find a symmetric mixed strategy equilibrium for this game. In this equilibrium, what is the probability that both are wearing the same color of dress? What is the expected payo to each of them in the symmetric mixed strategy equilibrium? bigskip The strategic form looks like this: Table 3: Dressing for the Ball C wears Red C wears Blue D wears Red 0,0 2,1 D wears Blue 1,2 0,0 In the symmetric mixed strategy equilibrium, each wears Red with probability 2/3. The probability that both wear the same color dress is 5/9. The expected payo to each of them is 2/3. B) Suppose that the duchess and the countess are each able to send a single message to the other. The message can be either I ll wear red or I ll wear blue. After they have received their messages, each of them chooses which dress to wear. Suppose that they both believe that if one of them sends message I ll wear red and the other says I ll wear blue, then each will wear the color she said she would wear. Suppose that they also believe that if both said they would 5
6 wear the same color, then each will ignore the messages and use the equilibrium mixed strategy found in Part A). ) Given these beliefs, construct a strategic form table showing the expected payo s that each would receive from saying I ll wear red or I ll wear blue given the other s message. Find a symmetric mixed strategy Nash equilibrium for this game. What is the expected payo to each of them in this Nash equilibrium? Table 4: Dress Talk C says Red C says Blue D says Red 2/3,2/3 2,1 D says Blue 1,2 2/3,2/3 In the symmetric Nash equilibrium, each says I ll wear red with probability 4/5. Each now has an expected payo of 14/15. C) Suppose that all is as before, except that the messages that they send can be one of three things. I ll wear red, I ll wear blue, or I ll wear the opposite. Suppose that they both believe that if one says red and one says blue, each will wear what she says she would. Suppose they also believe that if one names a color and the other says I ll wear the opposite that they both do what they said they would do. Finally, suppose that they both believe that if the two of them give the same response, then they will play the symmetric mixed strategies found in Part A. Construct a strategic form table showing the expected payo s that each would receive from each of the three messages, I ll wear red, I ll wear blue, and I ll wear the opposite. Find a mixed strategy Nash equilibrium for this game. What is the expected payo to each of them in this Nash equilibrium? Table 5: Dressing with Larger Vocabularies C says Red C says Blue C says Opposite D says Red 2/3,2/3 2,1 2,1 D says Blue 1,2 2/3,2/3 1,2 D says Opposite 1,2 2,1 2/3,2/3 To find a symmetric mixed strategy Nash equilibrium, let r be the probability that the countes says Red, let b be the probability that she says Blue and 1 r = b the probability that she says Opposite. Then solve two equations in two unknows for r and b, where one equatio makes the expected payo from 6
7 saying Red the same as that from saying Blue and the other makes the expected payo from saying Red the same as that from saying Opposite. The solution is r = 16/21, b =1/21, 1 r b =4/21. Expected payo for each of them is 31/32. Problem 6. In South Carburetor Illinois, half of the used cars are good and half of them are lemons. The current owners of lemons would be willing to sell them for any price above $1000, while the current owners of good used cars would be willing to sell them if and only if the price is greater than $7,000. There are a large number of buyers who would be willing to pay $10,000 for a good used car, but would be willing to pay only $2000 for a lemon. Buyers cannot tell a good used car from a lemon. All used cars must therefore sell at the same price. The price of a used car will be the expected value of a used car, given the beliefs of buyers about the kinds of cars that are for sale. A) Is there a pooling equilibrium in which buyers believe that all used cars will come on the market? If so, describe this equilibrium. If not, explain why not. No. There is not. If all buyers believed that all used cars reached the market, they would believe that the average used car was worth $6000. At a price of $6000, the owners of good used cars would not be willing to sell. The only cars that would come on the market would be lemons. The buyer s beliefs would not be confirmed. B) Suppose that in South Carburetor there is a car inspection shop that will inspect used cars and certify them as good if they pass some tests. Good used cars always pass the tests, but lemons only pass the tests with probability 1/4. To have his car inspected, a used car owner must pay a fee of $C, which he has to pay whether or not a car passes the test. For what values of C would there be a Bayes-Nash separating equilibrium in which only the owners of good used cars would have their cars inspected? In this equilibrium, what would be the price of a car that has passed inspection? What would be the price of a car that failed inspection? If only the good cars are inspected, then every car that passes inspection would be a good used car and would sell for $10,000 and every car that was not inspected would be a bad used car and would sell for $2000. If this is the case, good used car owners would keep their cars if they didn t have them inspected. They would be willing to pay C to have their cars inspected if C<$3000. If the owner of a lemon has his car inspected, he must pay C, but with probability 1/4, he can sell it for $10,000 and with probability 3/4 it would fail inspection and would sell for $2000. Therefore the expected payo to a lemon owner who has his car inspected is (1/4)10, (3/4)2000 C = 4, 000 C. A lemon owner who does not have his car inspected has an expected payo of 2,000. So 7
8 lemon owners would choose not to have their cars inspected if C>$2000. It follows that if $2000 <C<$3000, there will be a separating equilibrium in which only the good car owners have their cars inspected and hence all cars that pass inspection are good. C) For what values of the inspection fee C, would there be a Bayes-Nash equilibrium in which buyers believe that all used car owners have their cars inspected. In this case, what would be the expected value to buyers of a car that has passed inspection? (Hint: Calculating the conditional probability that a car is good, given that it has passed inspection is an application of Bayes rule. ) What would be the expected value to buyers of a car that has not passed inspection? If used cars that pass inspection sell for their expected value to buyers and cars that have not passed inspection sell for their expected value to buyers, would it be in the interests of the current owners to act in the way that buyers believe? Suppose that buyers believe that all used car owners have their cars inspected. In this case, the cars that have passed inspection include all of the good used cars and 1/4 of the lemons. Since half of the cars in town are good and half are lemons, this mean that the the fraction =1/5 of the cars that have passed inspection are lemons and the remaining 4/5 of the cars that have passed inspection are good. Given these beliefs, the expected value to buyers of a car that has passed inspection is (4/5)10, 000+(1/5)2000 = $8400. The expected value of cars that have not passed inspection would be $2,000. An owner of a good car would be willing to have his car inspected and sell it for $8400 if C<$1400. The owner of a lemon would be willing to have his car inspected if (1/4) /4(2000) C>$2000. This is the case if C<$1600. Therefore these beliefs will be confirmed if C<$1400. Problem 7. Everyone knows that in the city of Bent Crankshaft Ohio, 1/4 of the used cars are of high quality, 1/2 of the used cars are of medium quality, and 1/4 are of low quality. Their current owners know the quality of their cars. The high-quality used cars are worth an amount V H to their current owners. The medium-quality used cars are worth $18,000 to their current owners and the low-quality used cars are worth $10,000 to their current owners. Potential buyers of used cars in Crankshaft can not tell whether a car is of high low or medium quality and they know the proportions of each quality that are present in the population. A high-quality used car is worth $28,000 to buyers. A medium-quality used car is worth $21,000 to buyers, and a low-quality used car is worth $12,000 to buyers. Let us suppose that the market price of used cars is equal to the expected value of a random draw from the population of used cars that buyers believe will be available on the market. 8
9 A) For what values of V H would there be a pooling equilibrium in which buyers believe that all used cars in Bent Crankshaft are available on the market and their beliefs are confirmed by the outcome. If these are the buyers beliefs, the market price of used cars will be their expected value, which is $20,500. For V H apple20,500, all used car owners will want to sell at this price, so all used cars will be on the market. B) Suppose there is a pooling equilibrium in which all used cars in Bent Crankshaft are available on the market. Is there also a semi-separating equilibrium in which buyers beliefs are that medium and low quality used cars are on the market, but not high quality used cars? If so, what would be their expected value for of a used car. Explain. If buyers believe that all of the medium and low quality used cars but not the high quality used cars are on the market, then they will believe that 2/3 of the used cars on the market are of medium quality and 1/3 will be of low quality. The price of a used car would then be (2/3) (1/3)12000 = $18, 000. At this price, owners of low quality used cars would be willing to sell and owners of medium quality used cars would be (just barely) willing to sell. C) Is it possible for there to be three di erent perfect Bayes-Nash equilibria, one in which all used cars reach the market, one in which only the low and medium quality used cars reach the market and one in which only the low quality used cars reach the market? Explain Yes, we have already shown two possibilities. There is also an equilibrium where everybody believes that only lemons are available, the price is $2000 and only lemon owners want to sell. Problem 8. Consider a stage game with the strategic form found below, where Player 1 chooses the row and Player 2 chooses the column. Suppose that this game is repeated 20 times. After each round of play, both players are informed of all previous plays. The total payo to each player in this repeated game is the sum of the payo s received in the 20 repetitions of the stage game. A) Suppose that T>5. Find all of the Nash equilibria for the stage game. There are two Nash equilibria. In one of them, Player 1 plays c and Player 2playsy. In the other, Player 1 plays d and Player 2 plays z. B) For what values of T>5, if any, is there a subgame perfect Nash equilibrium for this repeated game, such that in equilibrium, Player 1 plays a and 9
10 Table 6: Stage Game w x y z a 5,5 0,T 0,0 1,2 b T,0 1,1 0,0 2,2 c 0,0 0,0 1,1 0,0 d 2,1 2,2 0,0 4,4 Player 2 plays w in the first 19 rounds of play? If this can be done, find a strategy for each player that results in this outcome. Suppose that Player 1 has the strategy Play a in the first round and for the next 18 rounds,play a if Player 2 has played w in every round so far and Player 1 has played a in every round so far. If either player ever plays anything else in any of the first 19 rounds, play c on all future rounds. If Player 2 has always played w and Player 1 has always played a on the first 19 rounds, then play d on the last round. Suppose that Player 2 s strategy is Play w on the first round and for the next 18 rounds, play w so long as Player 1 has played a and Player 2 has played w on every round so far. If either player deviates from these actions on the first 19 rounds, then play y in all future rounds. If Player 1hasalwaysplayeda on the first 19 rounds, then play z in the 20th round. If each of these strategies is a best response to the other, then there will be a Nash equilibrium in which the course of play is that Player 1 plays a and player 2playsw on each of the first 19 rounds and where Player 1 plays d and Player 2playsz on the last round. We need to check whether it pays anybody to deviate from this strategy, given the other player s strategy. Let s see if it pays Player 1 to deviate on the 19th round. Suppose that Player 1 chooses b on round 19. Then in Round 19, he will get a payo of T and in Round 20, he knows that Player 2 will play y. If Player 2isplayingy in round 20, the best that 1 can do is play c and get a payo of 1. So if he deviates in Round 19, he will get a payo of T +1 for the last two rounds. If he does not deviate in Round 19, then he will receive a payo of 5 in round 19 and Player 2 will play z in Round 20. If Player 2 plays z in round 20, the best that Player 1 can do in this round is play d which gives him a payo of 4 for a total of 5+4 in the last two rounds. So it will not pay for Player 1 to deviate in round 19 if T +1< 9 and it will pay him to deviate if T +1> 9. Therefore, we need T<8 if the strategies we propose are a Nash equilibrium. In fact, it is not hard to see that if it doesn t pay to deviate in round 19, it certainly doesn t pay to deviate earlier, since the punishment is greater, the earlier you deviate. By the symmetry of the game, the same argument that shows that it doesn t pay for Player 1 to deviate if T<8 also implies that it doesn t pay for Player 2 to deviate if T<8. C) For what values of T>5, if any, is there a subgame perfect Nash equi- 10
11 librium for this repeated game, such that in equilibrium, Player 1 plays a and Player 2 plays w in the first 18 rounds of play? If this can be done, find a strategy for each player that results in this outcome. The strategies proposed here will be like the ones in Part B, except that if both players have played their parts (w and a) on the first 18 rounds, then Player 1willplayd on the 19th and 20th rounds and Player 2 will play z on the 19th and 20th rounds. If either player deviates from this course of play, then Player 1willplayc on all remaining rounds and Player 2 will play y on all remaining rounds. This strategy will work when the temptation T is higher than the strategy outlined in Part B. We see this as follows. Suppose that up until the 18th round, Player 1 had been playing a and Player 2 had been playing w. If Player 1 chooses to deviate on the 18th round, he would get a payo of T in that round and then would get payo s of 1 in each of the two remaining rounds, giving him a total of T +2 for the last 3 rounds. If instead he plays a in the 18th round, he gets a payo of 5 in that round and 4 in rounds 19 and 20, giving him a total payo of 13 for the last 3 rounds. Therefore this deviation would reduce his total payo if T<11. Problem 9. Doc and Slim are playing a simplified version of poker. Each puts an initial bet of one dollar in a pot. Doc draws a card, which is either a King or a Queen with equal probabilities. Doc knows what he drew, but Slim does not. After looking at his card, Doc decides whether to Fold or Bet. If Doc chooses to Fold, the game ends and Slim gets all of the money in the pot. If Doc chooses to Bet, he puts another dollar in the pot. If Doc decides to bet, Slim must decide whether to Fold or Call. If Slim Folds, Doc wins the pot (which now contains 3 dollars, two of which he contributed himself.) If Slim Calls, Slim must add another dollar to the pot. Then Doc shows his card. If Doc has a King, Doc gets all the money (4 dollars) that is now in the pot. If Doc has a Queen, Slim gets all the money that is in the pot. A) List the possible strategies for Doc. List the possible strategies for Slim. Strategies for Doc are: Bet if King, Bet if Queen Bet if King, Fold if Queen Fold if King, Bet if Queen Fold if King, Fold if Queen 11
12 Slim has only two strategies, Fold or Call. B) Show this game in extensive form. Be careful about the information sets. Note that the payo s to each player are the amounts of money that player received from the pot minus the amount of money the player put into the pot. C Suppose that Doc bets if he draws a king and folds if he draws a queen and that Slim always folds. What is Doc s expected payo, given these two strategy choices? Hint: (Given these strategy choices, what is Doc s payo if he draws a king? What is Doc s payo if he draws a queen? ) His expected payo is zero. D) Show this game in strategic form where the payo s in each cell are expected payo s given each player s strategy. In the table below, Doc chooses the row and Slim chooses the column. Table 7: Poker Payo s Call Fold Bet if King, Bet if Queen 0,0 1,-1 Bet if King, Fold if Queen.5,-.5 0,0 Bet if Queen, Fold if King -1.5,1.5 0,0 Fold if Queen, Fold if King -1,1-1,1 12
13 D) Eliminate strictly dominated strategies if any. Find a Nash equilibrium in mixed strategies. What is the expected payo to Doc in this equilibrium? What is the expected payo to Slim in this equilibrium? The strategies Fold if Queen, Fold if King and Bet if Queen, Fold if King, are strictly dominated. The remaining game looks like this. Table 8: Poker Payo s (undominated strategies) Call Fold Bet if King, Bet if Queen 0,0 1,-1 Bet if King, Fold if Queen.5,-.5 0,0 This game has no pure strategy Nash equilibria. It has a mixed strategy Nash equilibrium in which Slim Calls with probability 2/3 and folds with probability 1/3 and Doc plays Bet if King, Bet if Queen (the blu ng strategy) with probability 1/3 and plays Bet if King, Fold if Queen with probability 2/3. The expected payo for Doc is 1/3 and the expected payo for Slim is -1/3. 13
Do not open this exam until told to do so.
Do not open this exam until told to do so. Department of Economics College of Social and Applied Human Sciences K. Annen, Winter 004 Final (Version ): Intermediate Microeconomics (ECON30) Solutions Final
1 Nonzero sum games and Nash equilibria
princeton univ. F 14 cos 521: Advanced Algorithm Design Lecture 19: Equilibria and algorithms Lecturer: Sanjeev Arora Scribe: Economic and game-theoretic reasoning specifically, how agents respond to economic
Bonus Maths 2: Variable Bet Sizing in the Simplest Possible Game of Poker (JB)
Bonus Maths 2: Variable Bet Sizing in the Simplest Possible Game of Poker (JB) I recently decided to read Part Three of The Mathematics of Poker (TMOP) more carefully than I did the first time around.
Microeconomic Theory Jamison / Kohlberg / Avery Problem Set 4 Solutions Spring 2012. (a) LEFT CENTER RIGHT TOP 8, 5 0, 0 6, 3 BOTTOM 0, 0 7, 6 6, 3
Microeconomic Theory Jamison / Kohlberg / Avery Problem Set 4 Solutions Spring 2012 1. Subgame Perfect Equilibrium and Dominance (a) LEFT CENTER RIGHT TOP 8, 5 0, 0 6, 3 BOTTOM 0, 0 7, 6 6, 3 Highlighting
Simon Fraser University Spring 2015. Econ 302 D200 Final Exam Solution Instructor: Songzi Du Tuesday April 21, 2015, 12 3 PM
Simon Fraser University Spring 2015 Econ 302 D200 Final Exam Solution Instructor: Songzi Du Tuesday April 21, 2015, 12 3 PM The brief solutions suggested here may not have the complete explanations necessary
ECON 40050 Game Theory Exam 1 - Answer Key. 4) All exams must be turned in by 1:45 pm. No extensions will be granted.
1 ECON 40050 Game Theory Exam 1 - Answer Key Instructions: 1) You may use a pen or pencil, a hand-held nonprogrammable calculator, and a ruler. No other materials may be at or near your desk. Books, coats,
Colored Hats and Logic Puzzles
Colored Hats and Logic Puzzles Alex Zorn January 21, 2013 1 Introduction In this talk we ll discuss a collection of logic puzzles/games in which a number of people are given colored hats, and they try
Probability and Expected Value
Probability and Expected Value This handout provides an introduction to probability and expected value. Some of you may already be familiar with some of these topics. Probability and expected value are
Perfect Bayesian Equilibrium
Perfect Bayesian Equilibrium When players move sequentially and have private information, some of the Bayesian Nash equilibria may involve strategies that are not sequentially rational. The problem is
Expected Value. 24 February 2014. Expected Value 24 February 2014 1/19
Expected Value 24 February 2014 Expected Value 24 February 2014 1/19 This week we discuss the notion of expected value and how it applies to probability situations, including the various New Mexico Lottery
How to Solve Strategic Games? Dominant Strategies
How to Solve Strategic Games? There are three main concepts to solve strategic games: 1. Dominant Strategies & Dominant Strategy Equilibrium 2. Dominated Strategies & Iterative Elimination of Dominated
University of Oslo Department of Economics
University of Oslo Department of Economics Exam: ECON3200/4200 Microeconomics and game theory Date of exam: Tuesday, November 26, 2013 Grades are given: December 17, 2013 Duration: 14:30-17:30 The problem
Chapter 18. Asymmetric Information. The buyer needs a hundred eyes, the seller not one. George Herbert (1651)
Chapter 18 Asymmetric Information The buyer needs a hundred eyes, the seller not one. George Herbert (1651) Chapter 18 Outline 18.1 Problems Due to Asymmetric Information 18.2 Responses to Adverse Selection
Price competition with homogenous products: The Bertrand duopoly model [Simultaneous move price setting duopoly]
ECON9 (Spring 0) & 350 (Tutorial ) Chapter Monopolistic Competition and Oligopoly (Part ) Price competition with homogenous products: The Bertrand duopoly model [Simultaneous move price setting duopoly]
Market Power and Efficiency in Card Payment Systems: A Comment on Rochet and Tirole
Market Power and Efficiency in Card Payment Systems: A Comment on Rochet and Tirole Luís M. B. Cabral New York University and CEPR November 2005 1 Introduction Beginning with their seminal 2002 paper,
Marginal cost. Average cost. Marginal revenue 10 20 40
Economics 101 Fall 2011 Homework #6 Due: 12/13/2010 in lecture Directions: The homework will be collected in a box before the lecture. Please place your name, TA name and section number on top of the homework
From the probabilities that the company uses to move drivers from state to state the next year, we get the following transition matrix:
MAT 121 Solutions to Take-Home Exam 2 Problem 1 Car Insurance a) The 3 states in this Markov Chain correspond to the 3 groups used by the insurance company to classify their drivers: G 0, G 1, and G 2
Aggressive Advertisement. Normal Advertisement Aggressive Advertisement. Normal Advertisement
Professor Scholz Posted: 11/10/2009 Economics 101, Problem Set #9, brief answers Due: 11/17/2009 Oligopoly and Monopolistic Competition Please SHOW your work and, if you have room, do the assignment on
UCLA. Department of Economics Ph. D. Preliminary Exam Micro-Economic Theory
UCLA Department of Economics Ph. D. Preliminary Exam Micro-Economic Theory (SPRING 2011) Instructions: You have 4 hours for the exam Answer any 5 out of the 6 questions. All questions are weighted equally.
Game Theory 1. Introduction
Game Theory 1. Introduction Dmitry Potapov CERN What is Game Theory? Game theory is about interactions among agents that are self-interested I ll use agent and player synonymously Self-interested: Each
MA 1125 Lecture 14 - Expected Values. Friday, February 28, 2014. Objectives: Introduce expected values.
MA 5 Lecture 4 - Expected Values Friday, February 2, 24. Objectives: Introduce expected values.. Means, Variances, and Standard Deviations of Probability Distributions Two classes ago, we computed the
Infinitely Repeated Games with Discounting Ù
Infinitely Repeated Games with Discounting Page 1 Infinitely Repeated Games with Discounting Ù Introduction 1 Discounting the future 2 Interpreting the discount factor 3 The average discounted payoff 4
8.3 Probability Applications of Counting Principles
8. Probability Applications of Counting Principles In this section, we will see how we can apply the counting principles from the previous two sections in solving probability problems. Many of the probability
Poker with a Three Card Deck 1
Poker with a Three Card Deck We start with a three card deck containing one Ace, one King and one Queen. Alice and Bob are each dealt one card at random. There is a pot of $ P (and we assume P 0). Alice
Chapter 7. Sealed-bid Auctions
Chapter 7 Sealed-bid Auctions An auction is a procedure used for selling and buying items by offering them up for bid. Auctions are often used to sell objects that have a variable price (for example oil)
Texas Hold em. From highest to lowest, the possible five card hands in poker are ranked as follows:
Texas Hold em Poker is one of the most popular card games, especially among betting games. While poker is played in a multitude of variations, Texas Hold em is the version played most often at casinos
$2 4 40 + ( $1) = 40
THE EXPECTED VALUE FOR THE SUM OF THE DRAWS In the game of Keno there are 80 balls, numbered 1 through 80. On each play, the casino chooses 20 balls at random without replacement. Suppose you bet on the
Bayesian Nash Equilibrium
. Bayesian Nash Equilibrium . In the final two weeks: Goals Understand what a game of incomplete information (Bayesian game) is Understand how to model static Bayesian games Be able to apply Bayes Nash
ECON 459 Game Theory. Lecture Notes Auctions. Luca Anderlini Spring 2015
ECON 459 Game Theory Lecture Notes Auctions Luca Anderlini Spring 2015 These notes have been used before. If you can still spot any errors or have any suggestions for improvement, please let me know. 1
6.042/18.062J Mathematics for Computer Science. Expected Value I
6.42/8.62J Mathematics for Computer Science Srini Devadas and Eric Lehman May 3, 25 Lecture otes Expected Value I The expectation or expected value of a random variable is a single number that tells you
ECO 199 B GAMES OF STRATEGY Spring Term 2004 PROBLEM SET 4 B DRAFT ANSWER KEY 100-3 90-99 21 80-89 14 70-79 4 0-69 11
The distribution of grades was as follows. ECO 199 B GAMES OF STRATEGY Spring Term 2004 PROBLEM SET 4 B DRAFT ANSWER KEY Range Numbers 100-3 90-99 21 80-89 14 70-79 4 0-69 11 Question 1: 30 points Games
CONTENT LAND BASED GAMES
CONTENT LAND BASED GAMES Live Keno 4 Street Racer 6 Darts Bet 8 Western Keno 10 Kings Jewels 12 Circus Fortune 14 Sports Betting 16 Keno Bet 18 Racing Bet 20 Poker Bet (Single Table) 22 Poker Bet + (3
Labor Economics, 14.661. Lecture 3: Education, Selection, and Signaling
Labor Economics, 14.661. Lecture 3: Education, Selection, and Signaling Daron Acemoglu MIT November 3, 2011. Daron Acemoglu (MIT) Education, Selection, and Signaling November 3, 2011. 1 / 31 Introduction
ECON101 STUDY GUIDE 7 CHAPTER 14
ECON101 STUDY GUIDE 7 CHAPTER 14 MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. 1) An oligopoly firm is similar to a monopolistically competitive
Game Theory and Poker
Game Theory and Poker Jason Swanson April, 2005 Abstract An extremely simplified version of poker is completely solved from a game theoretic standpoint. The actual properties of the optimal solution are
Minimax Strategies. Minimax Strategies. Zero Sum Games. Why Zero Sum Games? An Example. An Example
Everyone who has studied a game like poker knows the importance of mixing strategies With a bad hand, you often fold But you must bluff sometimes Lectures in Microeconomics-Charles W Upton Zero Sum Games
Two-State Options. John Norstad. [email protected] http://www.norstad.org. January 12, 1999 Updated: November 3, 2011.
Two-State Options John Norstad [email protected] http://www.norstad.org January 12, 1999 Updated: November 3, 2011 Abstract How options are priced when the underlying asset has only two possible
9 Repeated Games. Tomorrow, and tomorrow, and tomorrow, Creeps in this petty pace from day to day To the last syllable of recorded time Shakespeare
9 Repeated Games Tomorrow, and tomorrow, and tomorrow, Creeps in this petty pace from day to day To the last syllable of recorded time Shakespeare When a game G is repeated an indefinite number of times
Game Theory. CDAM Research Report LSE-CDAM-2001-09 October 8, 2001. 1 What is game theory? 4. 2 Definitions of games 6.
Game Theory Theodore L. Turocy Texas A&M University Bernhard von Stengel London School of Economics CDAM Research Report LSE-CDAM-2-9 October 8, 2 Contents What is game theory? 4 2 Definitions of games
Game Theory: Supermodular Games 1
Game Theory: Supermodular Games 1 Christoph Schottmüller 1 License: CC Attribution ShareAlike 4.0 1 / 22 Outline 1 Introduction 2 Model 3 Revision questions and exercises 2 / 22 Motivation I several solution
Would You Like To Earn $1000 s With The Click Of A Button?
Would You Like To Earn $1000 s With The Click Of A Button? (Follow these easy step by step instructions and you will) This Version of the ebook is for all countries other than the USA. If you need the
Example: Find the expected value of the random variable X. X 2 4 6 7 P(X) 0.3 0.2 0.1 0.4
MATH 110 Test Three Outline of Test Material EXPECTED VALUE (8.5) Super easy ones (when the PDF is already given to you as a table and all you need to do is multiply down the columns and add across) Example:
Midterm March 2015. (a) Consumer i s budget constraint is. c i 0 12 + b i c i H 12 (1 + r)b i c i L 12 (1 + r)b i ;
Masters in Economics-UC3M Microeconomics II Midterm March 015 Exercise 1. In an economy that extends over two periods, today and tomorrow, there are two consumers, A and B; and a single perishable good,
Homework 3, Solutions Managerial Economics: Eco 685
Homework 3, Solutions Managerial Economics: Eco 685 Question 1 a. Second degree since we have a quantity discount. For 2 GB the cost is $15 per GB, for 5 GB the cost is $10 per GB, and for 10 GB the cost
Economics Instructor Miller Oligopoly Practice Problems
Economics Instructor Miller Oligopoly Practice Problems 1. An oligopolistic industry is characterized by all of the following except A) existence of entry barriers. B) the possibility of reaping long run
Week 7 - Game Theory and Industrial Organisation
Week 7 - Game Theory and Industrial Organisation The Cournot and Bertrand models are the two basic templates for models of oligopoly; industry structures with a small number of firms. There are a number
6.207/14.15: Networks Lecture 15: Repeated Games and Cooperation
6.207/14.15: Networks Lecture 15: Repeated Games and Cooperation Daron Acemoglu and Asu Ozdaglar MIT November 2, 2009 1 Introduction Outline The problem of cooperation Finitely-repeated prisoner s dilemma
Oligopoly markets: The price or quantity decisions by one rm has to directly in uence pro ts by other rms if rms are competing for customers.
15 Game Theory Varian: Chapters 8-9. The key novelty compared to the competitive (Walrasian) equilibrium analysis is that game theoretic analysis allows for the possibility that utility/pro t/payo s depend
The Basics of Game Theory
Sloan School of Management 15.010/15.011 Massachusetts Institute of Technology RECITATION NOTES #7 The Basics of Game Theory Friday - November 5, 2004 OUTLINE OF TODAY S RECITATION 1. Game theory definitions:
EconS 503 - Advanced Microeconomics II Handout on Cheap Talk
EconS 53 - Advanced Microeconomics II Handout on Cheap Talk. Cheap talk with Stockbrokers (From Tadelis, Ch. 8, Exercise 8.) A stockbroker can give his client one of three recommendations regarding a certain
How To Play A Static Bayesian Game
Advanced Microeconomics Static Bayesian games Harald Wiese University of Leipzig Harald Wiese (University of Leipzig) Advanced Microeconomics / 7 Part E. Bayesian games and mechanism design Static Bayesian
Game Theory and Algorithms Lecture 10: Extensive Games: Critiques and Extensions
Game Theory and Algorithms Lecture 0: Extensive Games: Critiques and Extensions March 3, 0 Summary: We discuss a game called the centipede game, a simple extensive game where the prediction made by backwards
Moral Hazard. Itay Goldstein. Wharton School, University of Pennsylvania
Moral Hazard Itay Goldstein Wharton School, University of Pennsylvania 1 Principal-Agent Problem Basic problem in corporate finance: separation of ownership and control: o The owners of the firm are typically
Extreme cases. In between cases
CHAPTER 16 OLIGOPOLY FOUR TYPES OF MARKET STRUCTURE Extreme cases PERFECTLY COMPETITION Many firms No barriers to entry Identical products MONOPOLY One firm Huge barriers to entry Unique product In between
The Math. P (x) = 5! = 1 2 3 4 5 = 120.
The Math Suppose there are n experiments, and the probability that someone gets the right answer on any given experiment is p. So in the first example above, n = 5 and p = 0.2. Let X be the number of correct
Find the indicated probability. 1) If a single fair die is rolled, find the probability of a 4 given that the number rolled is odd.
Math 0 Practice Test 3 Fall 2009 Covers 7.5, 8.-8.3 MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Find the indicated probability. ) If a single
Double Deck Blackjack
Double Deck Blackjack Double Deck Blackjack is far more volatile than Multi Deck for the following reasons; The Running & True Card Counts can swing drastically from one Round to the next So few cards
Chapter 4 & 5 practice set. The actual exam is not multiple choice nor does it contain like questions.
Chapter 4 & 5 practice set. The actual exam is not multiple choice nor does it contain like questions. MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
Probabilistic Strategies: Solutions
Probability Victor Xu Probabilistic Strategies: Solutions Western PA ARML Practice April 3, 2016 1 Problems 1. You roll two 6-sided dice. What s the probability of rolling at least one 6? There is a 1
Adverse Selection. Chapter 3
Chapter 3 Adverse Selection Adverse selection, sometimes known as The Winner s Curse or Buyer s Remorse, is based on the observation that it can be bad news when an o er is accepted. Suppose that a buyer
Competition and Fraud in Online Advertising Markets
Competition and Fraud in Online Advertising Markets Bob Mungamuru 1 and Stephen Weis 2 1 Stanford University, Stanford, CA, USA 94305 2 Google Inc., Mountain View, CA, USA 94043 Abstract. An economic model
Hoover High School Math League. Counting and Probability
Hoover High School Math League Counting and Probability Problems. At a sandwich shop there are 2 kinds of bread, 5 kinds of cold cuts, 3 kinds of cheese, and 2 kinds of dressing. How many different sandwiches
COMP310 MultiAgent Systems. Chapter 11 - Multi-Agent Interactions
COMP310 MultiAgent Systems Chapter 11 - Multi-Agent Interactions What are Multi-Agent Systems? KEY organisational relationship interaction agent Environment sphere of influence 2 What are Multi-Agent Systems?
Buy or Lease a Car. published by AAA Fair Credit Foundation
Buy or Lease a Car published by AAA Fair Credit Foundation Buy or Lease a Car 1. What is Leasing?................................................................. 2 2. The Pros and Cons of Leasing and
6.254 : Game Theory with Engineering Applications Lecture 2: Strategic Form Games
6.254 : Game Theory with Engineering Applications Lecture 2: Strategic Form Games Asu Ozdaglar MIT February 4, 2009 1 Introduction Outline Decisions, utility maximization Strategic form games Best responses
Section 7C: The Law of Large Numbers
Section 7C: The Law of Large Numbers Example. You flip a coin 00 times. Suppose the coin is fair. How many times would you expect to get heads? tails? One would expect a fair coin to come up heads half
Laboratory work in AI: First steps in Poker Playing Agents and Opponent Modeling
Laboratory work in AI: First steps in Poker Playing Agents and Opponent Modeling Avram Golbert 01574669 [email protected] Abstract: While Artificial Intelligence research has shown great success in deterministic
Oligopoly: How do firms behave when there are only a few competitors? These firms produce all or most of their industry s output.
Topic 8 Chapter 13 Oligopoly and Monopolistic Competition Econ 203 Topic 8 page 1 Oligopoly: How do firms behave when there are only a few competitors? These firms produce all or most of their industry
8 Modeling network traffic using game theory
8 Modeling network traffic using game theory Network represented as a weighted graph; each edge has a designated travel time that may depend on the amount of traffic it contains (some edges sensitive to
AP Stats - Probability Review
AP Stats - Probability Review Multiple Choice Identify the choice that best completes the statement or answers the question. 1. I toss a penny and observe whether it lands heads up or tails up. Suppose
Computational Learning Theory Spring Semester, 2003/4. Lecture 1: March 2
Computational Learning Theory Spring Semester, 2003/4 Lecture 1: March 2 Lecturer: Yishay Mansour Scribe: Gur Yaari, Idan Szpektor 1.1 Introduction Several fields in computer science and economics are
Market Structure: Duopoly and Oligopoly
WSG10 7/7/03 4:24 PM Page 145 10 Market Structure: Duopoly and Oligopoly OVERVIEW An oligopoly is an industry comprising a few firms. A duopoly, which is a special case of oligopoly, is an industry consisting
T28 OLIGOPOLY 3/1/15
T28 OLIGOPOLY 3/1/15 1. Oligopoly is a market structure in which there are a small number of firms that engage in strategic interactions. If there are only two firms then we refer to the situation as a
Elementary Statistics and Inference. Elementary Statistics and Inference. 16 The Law of Averages (cont.) 22S:025 or 7P:025.
Elementary Statistics and Inference 22S:025 or 7P:025 Lecture 20 1 Elementary Statistics and Inference 22S:025 or 7P:025 Chapter 16 (cont.) 2 D. Making a Box Model Key Questions regarding box What numbers
EXAM. Exam #3. Math 1430, Spring 2002. April 21, 2001 ANSWERS
EXAM Exam #3 Math 1430, Spring 2002 April 21, 2001 ANSWERS i 60 pts. Problem 1. A city has two newspapers, the Gazette and the Journal. In a survey of 1, 200 residents, 500 read the Journal, 700 read the
Internet Advertising and the Generalized Second Price Auction:
Internet Advertising and the Generalized Second Price Auction: Selling Billions of Dollars Worth of Keywords Ben Edelman, Harvard Michael Ostrovsky, Stanford GSB Michael Schwarz, Yahoo! Research A Few
Games of Incomplete Information
Games of Incomplete Information Jonathan Levin February 00 Introduction We now start to explore models of incomplete information. Informally, a game of incomplete information is a game where the players
Solutions for Practice problems on proofs
Solutions for Practice problems on proofs Definition: (even) An integer n Z is even if and only if n = 2m for some number m Z. Definition: (odd) An integer n Z is odd if and only if n = 2m + 1 for some
Section 1.5 Linear Models
Section 1.5 Linear Models Some real-life problems can be modeled using linear equations. Now that we know how to find the slope of a line, the equation of a line, and the point of intersection of two lines,
33 DISCOUNTED PRESENT VALUE
33 DISCOUNTED PRESENT VALUE Purpose: To illustrate the idea of discounted present value with computations of the value of payments to be received in the future at different rates of interest. To use discounted
(SEE IF YOU KNOW THE TRUTH ABOUT GAMBLING)
(SEE IF YOU KNOW THE TRUTH ABOUT GAMBLING) Casinos loosen the slot machines at the entrance to attract players. FACT: This is an urban myth. All modern slot machines are state-of-the-art and controlled
Week 2: Conditional Probability and Bayes formula
Week 2: Conditional Probability and Bayes formula We ask the following question: suppose we know that a certain event B has occurred. How does this impact the probability of some other A. This question
10 Evolutionarily Stable Strategies
10 Evolutionarily Stable Strategies There is but a step between the sublime and the ridiculous. Leo Tolstoy In 1973 the biologist John Maynard Smith and the mathematician G. R. Price wrote an article in
Competition and Regulation. Lecture 2: Background on imperfect competition
Competition and Regulation Lecture 2: Background on imperfect competition Monopoly A monopolist maximizes its profits, choosing simultaneously quantity and prices, taking the Demand as a contraint; The
Bayesian Tutorial (Sheet Updated 20 March)
Bayesian Tutorial (Sheet Updated 20 March) Practice Questions (for discussing in Class) Week starting 21 March 2016 1. What is the probability that the total of two dice will be greater than 8, given that
Artificial Intelligence Beating Human Opponents in Poker
Artificial Intelligence Beating Human Opponents in Poker Stephen Bozak University of Rochester Independent Research Project May 8, 26 Abstract In the popular Poker game, Texas Hold Em, there are never
UNDERGROUND TONK LEAGUE
UNDERGROUND TONK LEAGUE WWW.TONKOUT.COM RULES Players are dealt (5) five cards to start. Player to left of dealer has first play. Player must draw a card from the deck or Go For Low. If a player draws
??? Signaling Games???
??? Signaling Games??? In incomplete information games, one player knows more information than the other player. So far, we have focused on the case where the type of the more informed player was known
GAMES WITH ONE DIE Games where you only use a single die can be plenty exciting indeed. Here are two good examples of this!
[TACTIC rules for dice games] Here are 21 different dice games, with one, two, three or even more dice. We wish you lots of enjoyment! GAMES WITH ONE DIE Games where you only use a single die can be plenty
ECO 199 GAMES OF STRATEGY Spring Term 2004 March 23 ADVERSE SELECTION SCREENING AND SIGNALING. EXAMPLE 1 FAILURE OF EQUILIBRIUM Akerlof s Lemons
ECO 199 GAMES OF STRATEGY Spring Term 2004 March 23 ADVERSE SELECTION SCREENING AND SIGNALING EXAMPLE 1 FAILURE OF EQUILIBRIUM Akerlof s Lemons Private used car market Car may be worth anywhere between
Exam. Name. How many distinguishable permutations of letters are possible in the word? 1) CRITICS
Exam Name How many distinguishable permutations of letters are possible in the word? 1) CRITICS 2) GIGGLE An order of award presentations has been devised for seven people: Jeff, Karen, Lyle, Maria, Norm,
LESSON 7. Leads and Signals. General Concepts. General Introduction. Group Activities. Sample Deals
LESSON 7 Leads and Signals General Concepts General Introduction Group Activities Sample Deals 330 More Commonly Used Conventions in the 21st Century General Concepts This lesson covers the defenders conventional
