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

First worth auction, An auction during which the bidder who submitted the v...

An auction during which the bidder who submitted the very best bid is awarded the item being sold and pays a worth equal to the number bid. Alternately, in a very procurement aucti

Assurance game, Assurance game Scenario "Assurance game" may be a generi...

Assurance game Scenario "Assurance game" may be a generic name for the sport a lot of commonly called "Stag Hunt." The French thinker, Jean Jacques Rousseau, presented the subse

Backward induction, Backward induction is an iterative procedure for resolv...

Backward induction is an iterative procedure for resolving finite general form or sequential games. First, one decides the finest policy of the player who makes the last move of th

Determine nash equilibria, Consider the electoral competition game presente...

Consider the electoral competition game presented in Lecture 6. In this game there are two candidates who simultaneously choose policies from the real line. There is a distribution

sub game excellent nash equilibrium , A sub game excellent Nash equilibriu...

A sub game excellent Nash equilibrium is an equilibrium such that players' methods represent a Nash equilibrium in each sub game of the initial game. it should be found by backward

Game tree, A game tree (also referred to as the in depth form) may be a gra...

A game tree (also referred to as the in depth form) may be a graphical illustration of a sequential game. It provides data concerning the players, payoffs, strategies, and also the

Nature , The title of a "player" who selects from among her methods randoml...

The title of a "player" who selects from among her methods randomly, primarily based on some predetermined chance distribution, instead of strategically, primarily based on payoffs

equilibrium refinement, An equilibrium refinement provides how of choosing...

An equilibrium refinement provides how of choosing one or many equilibria from among several in a very game. several games might contain many Nash equilibria, and therefore supply

Auctions, what will be the best strategy for a bidder in an auction compris...

what will be the best strategy for a bidder in an auction comprised of four bidders?

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