Calculate expected payoff, Game Theory

Assignment Help:

1. The town of Sunnydale, CA is inhabited by two vampires, Spike and Anya. Each night Spike and Anya independently hunt for food, which each one finds with probability 1/2 . Because of a telepathic link, each vampire knows whether the other vampire has found food. A food source contains 3/2 liters of blood, but in one session a vampire can only eat 1 liter of blood. If each vampire finds food they both eat 1 liter, giving each vampire a payoff of 1. If neither vampire finds food, both vampires have a payoff of 0. If one vampire finds food and the other doesn't, the vampire who found food may choose to share his or her food with the other vampire. If the vampire chooses to share, both vampires experience a payoff of 3/4 . If the vampire with food does not choose to share, the vampire who found food receives a payoff of 1 and the other vampire receives a payoff of 0. A vampire only has to make a decision if one of them finds food and the other doesn't.

(a) Suppose that the situation described above happens only one time. If Spike finds food but Anya doesn't, will he share? Would Anya share with Spike if she found food but he didn't? Does a vampire who found food have a dominant strategy?

(b) What is the expected payoff to each vampire if they follow the strategy in a.? Vampires live forever. Therefore, imagine that this situation is repeated an infinite number of times, and both vampires have the same discount factor. Suppose Spike and Anya agree to share food (if one finds food and the other doesn't) as long as in every past period in which one of them found food but the other didn't, the one who found food shared it. If at any point in the past a vampire found food but didn't share, they act as in part a.

(c) At the beginning of any particular night, before the vampires know whether they will find food, what is Spike's expected payoff if both he and Anya follow the agreement?

(Hint: with probability 1/4 both find food. With probability 1/2 at exactly one vampire finds food. With probability 1/4 neither vampire finds food.)

(d) Suppose Spike found food in period k but Anya didn't. What is his expected payoff from following the agreement in that period? (Hint: his payoff is composed of two pieces. First Spike experiences today's payoff of sharing food with Anya. By doing so, he also preserves the agreement forever after)

(e) What is Spike's expected payoff if he doesn't share his food with Anya? (Hint: he does better in the current period, but destroys the agreement from tomorrow on)

(f) For which values of is the agreement self-sustaining? (That is, acting according to the agreement is a sub-game perfect Nash Equilibrium)

(g) Speculate about what would happen if the probability of finding food were close to 1 or close to 0. Would the agreement be easier or more difficult to sustain?

(h) Now suppose that the telepathic link between Spike and Anya does not always operate. Thus, neither vampire knows for certain whether the other one has found food. Of course, if the other shares, the receiver learn that the other one found food. However, if a vampire finds food but chooses not to share, the other vampire only finds out through the telepathic link with probability 2/3. For which values of is the agreement self-sustaining? Explain the difference with f.


Related Discussions:- Calculate expected payoff

Calculate the expected payout, James and Dean are playing the Chicken game....

James and Dean are playing the Chicken game. They have noticed that their payout for being perceived as "tough" depends on the size of the crowd. The larger the crowd, the "cooler"

Three words, if the first three words are "the boy''s down" what are the la...

if the first three words are "the boy''s down" what are the last three words?

Trigger strategy, can i analyse all games under trigger strategies or it''s...

can i analyse all games under trigger strategies or it''s possible just for prisoners dilemma?

Positive add, In a positive add game, the combined payoffs of all players a...

In a positive add game, the combined payoffs of all players aren't identical in each outcome of the sport. This differs from constant add (or zero add) games during which all outco

Compute the nash equilibrium, Consider two quantity-setting firms that prod...

Consider two quantity-setting firms that produce a homogeneous good. The inverse demand function for the good is p = A - (q 1 +q 2 ). Both firms have a cost function C = q 2 (a

Application to business strategy, Game Theory has evolved since its start a...

Game Theory has evolved since its start as a thought exercise for academic mathematicians. Taught in economics departments , top business schools, and the strategic analysis, even

Minimum bid, A minimum bid is that the smallest acceptable bid in an auctio...

A minimum bid is that the smallest acceptable bid in an auction. a gap bid, the primary bid placed within the auction, should be a minimum of as high because the minimum bid or the

Two player problem of points set up - game theory, a) Show that A c...

a) Show that A counting proof could be fun(?). But any old proof will do. (Note that the coefficients (1,2,1) in the above are just the elements of the second row of Pas

Paradox of identification, Discussion in the preceding section suggests tha...

Discussion in the preceding section suggests that if we want to measure a given hnction belonging to a simultaneous-equations model, the hnction must be fairly stable over the samp

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd