Question

Write about a game one can experience in their everyday life. Describe who the players are,...

Write about a game one can experience in their everyday life. Describe who the players are, what moves are available to them, what information they have when moving, and why the payoffs are what they are.

Draw out a game tree. How many strategies do the players have? What are they?

Are there any pure strategy Nash equilibria? If so, does the game usually turn out that one of them was played? If so, which one? Why do you think this is the case?

Homework Answers

Answer #1

Matching Pennies is one of the best examples of the application Game theory in daily life. Most of us either know or played this interesting game. This game teaches how a decision maker can maximise his payoffs thinking rationally. Matching penny include two players, they place penny on the table together. Their payoff depends on whether the penny matches or not. Both players know the possible moves and its consequences as they know the rules of the game. If both pennies are heads and tails, the player who played first wins and keeps other’s pennies with him. In other way, if both pennies do not match, the second player wins and keeps first player’s penny. Matching pennies is considered as a zero-sum game, because one player’s win is treated as the other player’s loss. Each player has an equal chance to select heads or tails, they do it randomly. Therefore, there is no nash equilibrium in this situation, because neither player has not encouraged to select different strategy to beat his counter player’s move.

Following figure shows the matching pennies payoff matrix of two players A and B.

A/B

Heads

Tails

Heads

  1. +1,-1

ii) -1, +1

Tails

iii) -1, +1

iv) +1, -1

  

The table shows the payoff numbers of both players A, B, the first number represents payoffs of player A and second number shows payoffs of player B. +1 means, player wins a penny and -1 is losing a penny. If both players play “Heads” first player wins that’s why in (i), player A got +1 and player B got -1. Here player A got B’s pennies. If A plays “Heads” B plays “Tails”, reverse is happened. Therefore, in cell (ii) it is (-1,+1), meaning is A losses a penny and B gain A’s penny. Similarly, if player A plays “Tails” and B plays “Heads”, the payoffs will be like in cell (iii) and if both play “Tails” player A wins B’s penny as shown in cell (iv).

Know the answer?
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
Similar Questions
Suppose that the NFL and the NFL Players Association are negotiating on a new collective bargaining...
Suppose that the NFL and the NFL Players Association are negotiating on a new collective bargaining agreement. Each side has the options to either be mean or be nice in negotiations. Suppose we model the game as a simultaneous move game, depicted in the game box below. Note: The payoffs below are depicted as: (NFL payoff, Players Association payoff) The Players Association Be Mean Be Nice The NFL Be Mean 15, 0 20, 10 Be Nice 10, 20 30, 15...
Consider the following simultaneous-move game: Column L M N P Row U (1,1) (2,2) (3,4) (9,3)...
Consider the following simultaneous-move game: Column L M N P Row U (1,1) (2,2) (3,4) (9,3) D (2,5) (3,3) (1,2) (7,1) (a) Find all pure-strategy Nash equilibria. (b) Suppose Row mixes between strategies U and D in the proportions p and (1 − p). Graph the payoffs of Column’s four strategies as functions of p. What is Column’s best response to Row’s p-mix? (c) Find the mixed-strategy Nash equilibrium. What are the players’ expected payoffs?
This problem refers to the following game: A B A (2, 4) (0, 2) B (1,...
This problem refers to the following game: A B A (2, 4) (0, 2) B (1, 1) (3, 4) a.       What are the pure-strategy Nash equilibria? b.       Is there a mixed strategy Nash equilibrium where both players mix A and B? If so, find the equilibrium. If not, explain why not.
4. Consider the following non-cooperative, 2-player game. Each player is a middle manager who wishes to...
4. Consider the following non-cooperative, 2-player game. Each player is a middle manager who wishes to get a promotion. To get the promotion, each player has two possible strategies: earn it through hard work (Work) or make the other person look bad through unscrupulous means (Nasty). The payoff matrix describing this game is shown below. The payoffs for each player are levels of utility—larger numbers are preferred to smaller numbers. Player 1’s payoffs are listed first in each box. Find...
Game Theory: John and Dave are playing a game where they only have two strategies, either...
Game Theory: John and Dave are playing a game where they only have two strategies, either to move left or move right. The payoffs from this game are the points that each player will earn given the strategies that each play. The higher the points, the higher the payoffs each player will receive. The normal form representation of the game is presented below.                                                    DAVE                         Left                                                  Right Left 1,1 0,3 Right 3,0 2,2 John's name label should be on...
When playing card games like poker, the strategies available to players can sometimes be summarized as:...
When playing card games like poker, the strategies available to players can sometimes be summarized as: Use Randomness (play unpredictably so that your opponents can't understand your moves). Use Math (calculate probabilities based on the cards you can see, and use this information to make your decisions). Use Psychology (watch your opponents for signs that they have especially good or bad hands). A particular pair of players have different levels of skill in each of these strategies, so that their...
Consider the following one-shot simultaneous game: Firm 2 Advertising campaign Do nothing Firm 1 Advertising campain...
Consider the following one-shot simultaneous game: Firm 2 Advertising campaign Do nothing Firm 1 Advertising campain 3, 8 20, 8 Offer discounts 6, 8 9, 2 Do nothing 7, 10 9, 12 a. State all the dominated strategies in the game, by which strategy they are dominated, and whether weakly or strictly. b. What is the equilibrium outcome by dominance (by elimination of dominated strategies), if any? c. What is (or are) the pure strategy Nash equilibria of this game?
The matrix below shows payoffs in a stag hunt game. If both hunters hunt stag, each...
The matrix below shows payoffs in a stag hunt game. If both hunters hunt stag, each gets a payoff of 4. If both hunt hare, each gets 3. If one hunts stag and the other hunts hare, the stag hunter gets 0 and the hare hunter gets 3. Hunter B hunt stag hunt hare hunt stag 4,4 0,3 Hunter A hunt hare 3,0 3,3 (a) If you are sure that the other hunter will hunt stag, what is the best...
24. Two players are engaged in a game of Chicken. There are two possible strategies: swerve...
24. Two players are engaged in a game of Chicken. There are two possible strategies: swerve and drive straight. A player who swerves is called Chicken and gets a payoff of zero, regardless of what the other player does. A player who drives straight gets a payoff of 432 if the other player swerves and a payoff of −48 if the other player also drives straight. This game has two pure strategy equilibria and a. a mixed strategy equilibrium in...
Mike and Jake are basketball players who sometimes flop (that is, intentionally fall or feign an...
Mike and Jake are basketball players who sometimes flop (that is, intentionally fall or feign an injury in order to cause a foul on another player). It is better for each of them if both play fairly and don't flop then when both flop. But each player is better off flopping than not flopping. Their payoffs are given below. Jake Mike Flop Not Flop Flop (3, 3) (4, 1) Not Flop (1, 4) (1, 1) For instance, if Mike flops...