Green –beard strategy, Game Theory

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

Posted Date: 2/21/2013 4:36:51 AM | Location : United States







Related Discussions:- Green –beard strategy, Assignment Help, Ask Question on Green –beard strategy, Get Answer, Expert's Help, Green –beard strategy Discussions

Write discussion on Green –beard strategy
Your posts are moderated
Related Questions
Explain oligopoly's structure and use game theory to explain why oligopoly firms tend not to use price to compete. Answer- Oligopoly is an imperfect market where there are

Suppose that the incumbent monopolist, in the previous question, can decide (before anything else happens) to make an irreversible investment in extra Capacity (C), or Not (N). If

Find Pure Nash Equilibria 1. Consider a two-player game in which player 1 chooses the strategy x 1 from the closed interval [-1, 1] while player 2 chooses the strategy x 2 fr

A type of auction in which the highest bidder is rewarded the object, but all bidders pay the auctioneer their bids. This differs from traditional first price auctions in which onl

A sequential game is one among one in all if just one player moves at a time and if every player is aware of each action of the players that moved before him at every purpose. Tech

While ancient auctions involve one seller and plenty of consumers, a reverse auction typically involves several sellers and one buyer. for instance, procurement auctions are used t

Three flowcharts and the game board for your mousetrap game should be submitted. You can use board_design.pdf to help you lay out your board. Basically, you can use any shapes you

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

Scenario Any game during which the identity of the player doesn't amendment the ensuing game facing that player is symmetric. In different words, every player earns identical pa

A proxy bidder represents the interests of a bidder not physically gift at the auction. Typically, the bidder can inform his proxy of the most quantity he's willing to pay, and als