beard strategy, Game Theory, Game Theory

#questi1 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 faceon..
Posted Date: 5/2/2013 2:21:47 PM | Location : United States

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

Write discussion on beard strategy, Game Theory
Your posts are moderated
Related Questions
can i analyse all games under trigger strategies or it''s possible just for prisoners dilemma?

A heuristic is an aid to learning, casually brought up as a rule of thumb. Formally, a heuristic may be a mechanism capable of altering its internal model of the surroundings in re

Matches or different objects are organized in 2 or a lot of piles. Players alternate removing some or all of the matches from anyone pile. The player to get rid of the last match w

Please let me know if you can assist with the following assignment immediately.

Normal 0 false false false EN-US X-NONE X-NONE

Consider a game in which player 1 chooses rows, player 2 chooses columns and player 3 chooses matrices. Only Player 3''s payoffs are given below. Show that D is not a best response

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

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

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

Treating probability as a logic, Thomas Bayes defined the following: Pr(X|Y)=Pr(Y|X)Pr(X)/Pr(Y) For example, probability that the weather was bad given that our friends playe