Full equilibrium strategy example, Game Theory

Assignment Help:

 (a) A player wins if she takes the total to 100 and additions of any value from 1 through 10 are allowed. Thus, if you take the sum to 89, you are guaran- teed to win; your opponent must take the sum to at least 90 but can take it no higher than 99. In either case you can get to 100 on the next move. Using rollback, you can show that you can win if you can get the sum to 78 or to 67 . . . or to 12 or to 1. Thus, being the first mover and using a strategy that entails choosing 1 on the first move and then saying 11 minus whatever your opponent says allows you to win; you take the sum successively to 12, 23, . . ., 78, 89, and 100.

Technically, the full equilibrium strategy is

(i) if you are the first player, start with 1;

(ii) if the current total is not (100 – 11n) for some n, then choose the number that will bring the total to this form; or

(iii) if the current total is of the form (100 – 11n), then choose any number (all choices are equally bad).


(b) In this version, you lose if you force the total to equal or exceed 100, so you can win if you take the total to 99. Using the same type of analysis as  above, you see that you can win if you can get the sum to 88, 77, . . ., 22, or 11. This time you want to be the second mover. Your strategy should be to say 11 minus whatever your opponent says; this strategy takes you successively to 11, 22, . . ., 77,88, 99, and a win.

The full equilibrium strategy is

(i) if you are the first player, choose any number (all choices are equally bad);

(ii) if the current total is a multiple of 11, choose any number (all choices are equally bad); or

(iii) if the current total is not a multiple of 11, choose the number that will make the total a multiple of 11 (this is equivalent to choosing 11 minus the number just chosen by your opponent).


Related Discussions:- Full equilibrium strategy example

Green –beard strategy, 1  A, Explain how a person can be free to choose but...

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 pe

Find pure nash equilibria, Find Pure Nash Equilibria 1. Consider a two-...

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

Draw the strategic form game - nash equilibrium, 1. Consider a two-player g...

1. Consider a two-player game where player A chooses "Up," or "Down" and player B chooses "Left," "Center," or "Right". Their payoffs are as follows: When player A chooses "Up" and

Button auction, A form of a Japanese auction (which is a form of an English...

A form of a Japanese auction (which is a form of an English auction) in which bidders hold down a button as the auctioneer frequently increases the current price. Bidders irrevocab

Minimum bid, A minimum bid is that the smallest acceptable bid in an auctio...

A minimum bid is that the smallest acceptable bid in an auction. a gap bid, the primary bid placed within the auction, should be a minimum of as high because the minimum bid or the

Paired prisoners'' dilemma, Paired Prisoners' Dilemma Students can be p...

Paired Prisoners' Dilemma Students can be paired off and instructed to play several ver-sions of a particular game with a prisoners' dilemma structure.Provide each pair with a

Positive add, In a positive add game, the combined payoffs of all players a...

In a positive add game, the combined payoffs of all players aren't identical in each outcome of the sport. This differs from constant add (or zero add) games during which all outco

Identify the pure strategy equilibria, Consider the following three games (...

Consider the following three games (Chicken, Matching Pennies, Stag Hunt): Chicken Player 2 Player 1 D V D -100;-100 10;-10 V -10; 10 -1;-1 Matching Pennies Pla

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
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