Green –beard strategy, Game Theory

Assignment Help:

1  A, Explain how a person can be free to choose but his or her choices are casually determined by past event

2  B , Draw the casual tree for newcomb's problem when Eve can't perfectly detect Adam's casual history. The probabilities of Eve rightly or wrongly detecting whether adam will later open only the black box instead of opening both boxes are respectively denoted r and w. recal that L denotes the smaller amount of money always in the clear box and M denotes the larger amount of money that eve might might put in side the opaque box  E A

C, Derive the two expected payoffs formulas E A (1B / r, w) and E A ( (2B /r,w) and use them to solve for another formula that equals the smallest value of M (denoted M*) required in order for Adam's expected payoff from opening only the opaque box to exceed that from opening both boxes by a multiple of as least ( a sign that looks like derivative)  L     what is the resulting formula for M*. finally suppose (L, sign that looks like derivative I don't know   )  = (300, 95), (r,w)=(.58, .43) and use the formula for M* to calculate the numerical value of M* for this case

 2.   A, Suppose a CD player player tries to detect whether its partner is C player instead of a DD player by looking for external signals that are at least as typical for DD players than DD players than for cd players draw a diagram tp explain how two boundariesb.L and bu  are optimally determined by the minimum likehood ration Lmin. Show on the diagram where it is optimal to respond C versus D. Also explain what happens to the boundries when detection becomes more cautious by raising the minimum likehood ration

b. What is meaning of the LDD detection strategy

c. What is the main problem with the green -beard strategy? Explain how the LDD strategy overcomes this problem

 3. A. If CD players are able to use the LDD strategy better than pure chance then explain what happens to the signal reliability ration as a CD player detects more cautiously

 b. Assume a population contains either CD ot DD players where each player is randomly matched with partner taken from the whole population. Also assume the fear and greed payoff differences are equal. What are the expected payoff formulas for CD players  [ denoted  E(DD/x CD  ) ]  depending on the fraction of CD players in the population, denoted x CD  \

c. Use expected payoff formulas of part C to algebraically derive an inequality for the signal reliability ration r/w that determines when the CD  players will outperform the DD players. Thenuse this inequality with Part A, to explain how CD players can always outperform DD players starting from any positive initial fraction of CD players  x CD  > 0.

 4, A. Use the inequality derived for part C question 3; to obtain an inequality required x *CD  = 1 to remain stable against DD invaders. Also draw the ROC diagram discussed in class for visually representing this stability inequality

B. Explain how a diagram similar to that shown in part A can be used to derive a prediction of what will happen to the CD players equilibrium probability of cooperating if the fear and greed pay off difference decrease relative to the cooperation payoff difference

C. Again explain how a diagram similar to that shown in Part A can be used to derive a prediction of what will happen to the CD player equilibrium probability of cooperating if they exchange email messages instead of talking talk face to face


Related Discussions:- Green –beard strategy

Games sequential moves-game played b/w pitcher and batter, Problem: Consid...

Problem: Consider a (simplified) game played between a pitcher (who chooses between throwing a fastball or a curve) and a batter (who chooses which pitch to expect). The batter ha

Game of chicken, Scenario Two hooligans with one thing to prove drive at...

Scenario Two hooligans with one thing to prove drive at one another on a slender road. the primary to swerve loses faces among his peers. If neither swerves, however, a terminal

Nash equilibrium - pay off, The following is a payoff matrix for a non-coop...

The following is a payoff matrix for a non-cooperative simultaneous move game between 2 players. The payoffs are in the order (Player 1; Player 2): What is the Nash Equilibri

Find all nash equilibria of game- game theory, Game Theory: (prisoner'...

Game Theory: (prisoner's dilemma) Consider the following 2 x 2 pricing game, where rms choose whether to price High or Low simultaneously. Find the equilibrium in dominant s

Personal theory of international trade, I have an assignment in which I hav...

I have an assignment in which I have to invent a new international trade theory. For me, the absolute advantage of Adam Smith is really good, and I want to find a solution if a cou

Compute pure strategy and mixed strategy equilibria of game, Ronaldo (Brazi...

Ronaldo (Brazil) kicks a penalty against Casillas (Spain) in the 2006 World Cup nal. Sup- pose that Ronaldo can kick the ball to Casillas' upper left (UL), lower left (LL), upper r

Absolute auction, A general term for an English auction in which there is n...

A general term for an English auction in which there is no reserve price, guaranteeing that the object will be sold to the highest bidder regardless of the quantity of the bid.

Blind auction, Another term for a preserved bid auction in which bidders si...

Another term for a preserved bid auction in which bidders simultaneously submit bids to the auctioneer with no knowledge of the amount bid by other member. Usually, the uppermost b

Find the quantities that firm is selling – equilibrium price, 1. Two firms,...

1. Two firms, producing an identical good, engage in price competition. The cost functions are c 1 (y 1 ) = 1:17y 1 and c 2 (y 2 ) = 1:19y 2 , correspondingly. The demand functi

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