Question

In: Economics

Suppose n people are choosing between two activities, hiking or fishing, where n is an even...

Suppose n people are choosing between two activities, hiking or fishing, where n is an even number. The payoff from going to hike is 1 if more than half of the people go hiking, and 0 otherwise. The payoff from going to fish is 1 if more than half of the people go fishing, and 0 otherwise.

A.Find all the Nash Equilibria of this game, if any.

B.Suppose instead that the payoffs are such that the payoff to hiking is 1 if less than half of the people go hiking, and 0 otherwise, and the payoff to going fishing is 1 if less than half of the people go fishing, and 0 otherwise (remember that n is an even number). The goal will be to find all Nash Equilibria. First consider the case where h<(n/2)-1, where h=the number of people hiking. Are there Nash Equilibria where h<(n/2)-1?

C.Now consider the case where h=(n/2)-1.Are there Nash Equilibria where h=(n/2)-1?

D.Now Consider the case where h=(n/2). Are there Nash Equilibria where h=(n/2)?

E.Now consider the case where h=(n/2)+1. Are there Nash Equilibria where h=(n/2)+1?

F.Now Consider the case where h>(n/2)+1. Are there Nash Equilibria where h>(n/2)+1?

Solutions

Expert Solution

A. Two Nash Equilibria

(n, 0) and (0, n) i. e., either everyone go hiking or everyone go fishing.

Nash Equilibrium is a situation where not a single person has any inventive to deviate from the strategy he/she has chosen.

Let's start by taking a case where the number of people going to hiking is not equal to the number of people going to fishing. It doesn't matter which is higher. If number of people going to fishing is lower then everyone who is going to fishing has an incentive to move away because the number of people going to hiking is more than half of the total people and moving away will earn a payoff of 1 whereas staying in the group of fishers will earn a payoff of 0. This will continue till everyone changes their decision from fishing to hiking. After everyone go to hiking there is no incentive to anyone to deviate. So everyone going to hiking is a Nash equilibrium.

Similar analysis works when the number of people going to hiking is lower. Then the result will be everyone going to fishing.

Now let's assume that number of people going to fishing and hiking is same i. e., h=f=(n/2). Here everyone earns a payoff of 0.Here at least one person in either group has incentive to move away because the person that moves away will make his/her destination group higher in number and earns a payoff of 1.

So {(n/2) (n/2) } is not a Nash Equilibrium.

Hence Either everyone go fishing or everyone go hiking are the two Nash Equilibria.

B. h< (n/2) -1

This is not a Nash Equilibrium. Because one person in the other group (fishing) has an incentive to join the group of hiking. If one person moves from fishing to hiking, 'h' will still be lesser than (n/2) and this person will get a payoff off of 1. This deviation will stop only when the h=(n/2) -1.

When h=(n/2) -1, no one has an incentive to deviate i. e., deviating from fishing to hiking will make h=f=n/2 and everyone gets pay off 0. So the person who was fishing earlier hasn't got any better. People who are hiking are already getting a pay off of 1. So they don't have any incentive to deviate.

So h=(n/2) -1 is Nash equilibrium. Then f=(n/2)+1

Similar analysis for fishing will result in f=(n/2) -1 being Nash equilibrium. Then h=(n/2)+1

So {(n/2) -1, (n/2) +1} and {(n/2) +1, (n/2)-1} are both Nash Equilibria.

Now h=f=(n/2)

Now no one has any incentive to deviate because deviation in any direction will not improve the playoff of any person.

Therefore, h=f=n/2 i. e. , [(n/2) (n/2)] is a Nash equilibrium.

Half people going to fishing and half going to hiking is a Nash equilibrium.

Hence {(n/2), (n/2)}; {(n/2) -1, {(n/2) +1}; {(n/2) +1, (n/2) -1} are the three Nash Equilibria.

C. Yes. h=(n/2)-1 is a Nash Equilibrium

See part B

D. Yes. h=(n/2) is a Nash equilibrium.

See part B

E. Yes. h=(n/2) +1 is a Nash equilibrium.

f=(n/2)-1 is equivalent of h=(n/2) +1

See part B

F. No.

When h>(n/2)+1, f<(n/2) -1

This means people who are fishing are getting a payoff of 1 and hiking people are getting 0. In this case at least one person in hiking group has incentive to move to fishing because doing so the number of fishing people will still be lesser than (n/2) and this person will get an improvement in his/her payoff from 0 to 1.

So this person has an incentive to deviate.

Hence h>!(n/2) +1 is not a Nash Equilibrium.


Related Solutions

Suppose n people can choose between going to one of two campgrounds for 4th of July...
Suppose n people can choose between going to one of two campgrounds for 4th of July weekend. They can go to either Campground A or Campground B. The payoff to going to Campground A is 100-a, where a is the number of people in Campground A, and the payoff to going to Campground B is 200-2b, where b is the number of people in Campground B, such that a+b=n, and a, b, and n have to be greater than or...
Consider an n×n square board, where n is a fixed even positive integer. The board is...
Consider an n×n square board, where n is a fixed even positive integer. The board is divided into n 2 unit squares. We say that two different squares on the board are adjacent if they have a common side. N unit squares on the board are marked in such a way that every unmarked square on the board is adjacent to at least one marked square. Determine the smallest possible value of N.
Suppose that there is a rural community with a lake, where everyone’s economic activity is fishing....
Suppose that there is a rural community with a lake, where everyone’s economic activity is fishing. Everyone in that community has more or less the same fishing equipment (boats, rods, etc.), the same fishing skills (knowledge about fishing), and the same luck catching the fish. All of the individual’s well-being depends on the quantity of fish they catch from the lake and then sell on the city. The price at which the fish is sold is not controlled by the...
Let G be a simple undirected graph with n vertices where n is an even number....
Let G be a simple undirected graph with n vertices where n is an even number. Prove that G contains a triangle if it has at least (n^2 / 4) + 1 edges using mathematical induction.
Determine the number of permutations of {1,2,3,...,n-1,n} where n is any positive integer and no even...
Determine the number of permutations of {1,2,3,...,n-1,n} where n is any positive integer and no even integer is in its natural position.
Suppose that the birthdays of different people in a group of n people are independent, each...
Suppose that the birthdays of different people in a group of n people are independent, each equally likely to be on the 365 possible days. (Pretend there's no such thing as a leap day.) What's the smallest n so that it's more likely than not that someone among the n people has the same birthday as you? (You're not part of this group.)
PROBLEM 6. Suppose that the birthdays of different people in a group of n people are...
PROBLEM 6. Suppose that the birthdays of different people in a group of n people are independent, each equally likely to be on the 365 possible days. (Pretend there's no such thing as a leap day.)What's the smallest n so that it's more likely than not that someone among the n people has the same birthday as you? (You're not part of this group.)
Prove by induction on n that the number of distinct handshakes between n ≥ 2 people...
Prove by induction on n that the number of distinct handshakes between n ≥ 2 people in a room is n*(n − 1)/2 . Remember to state the inductive hypothesis!
There are n people who can shake hands with one another (where n > 1). Use...
There are n people who can shake hands with one another (where n > 1). Use pigeonhole principle to show that there is always a pair of people who will shake hands with the same number of people. Hint. Pigeonhole principle does not immediately apply to this problem. Solve the problem for two cases: (1) There is no person who shakes hands with everyone else (all handshake numbers are strictly less than n − 1). Easy case. (2) There is...
Suppose A^2= A , where A is an n by n matrix. Use Jordan canonical form...
Suppose A^2= A , where A is an n by n matrix. Use Jordan canonical form to thaw that A is diagonalizable.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT