User Account

All Pages

beard strategy, Game Theory, Game Theory

Assignment Help:
#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..

Related Discussions:- beard strategy, Game Theory

English auction, A type of sequential second worth auction during which an ...

A type of sequential second worth auction during which an auctioneer directs participants to beat the present, standing bid. New bids should increase the present bid by a predefine

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

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

Grim trigger strategy, A trigger strategy sometimes applied to repeated pri...

A trigger strategy sometimes applied to repeated prisoner's dilemmas during which a player begins by cooperating within the initial amount, and continues to cooperate till one defe

Game playing in class:adding numbers—win at 100, GAME PLAYING IN CLASS GAME...

GAME PLAYING IN CLASS GAME 1 Adding Numbers—Win at 100 This game is described in Exercise 3.7a. In this version, two players take turns choosing a number between 1 and 10 (inclus

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?

Procurement auction, A market mechanism during which an object, service, or...

A market mechanism during which an object, service, or set of objects is being purchased, instead of sold, to the auctioneer. The auction provides a selected set of rules which wil

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

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

Dynamic game, Normal 0 false false false EN-US X-NONE...

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

Write Your Message!

Captcha
Order Assignment

Featured Services

Order Now

Popular Subjects

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!

Submit Assignment

Academics

Major Subjects

Majors

Get In Touch

whatsapp: +1-415-670-9521

Phone: +1-415-670-9521

Email: [email protected]

TERMS & POLICIES

HELP & SUPPORT

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