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

Discriminatory auction, A multiunit auction that during which within which ...

A multiunit auction that during which within which  each winning bidder pays a unique worth which depends on the particular bid placed by every winning participant. Alternatively,

State the profit maximization problem of firm, 1. Consider two firms produc...

1. Consider two firms producing an identical product in a market where the demand is described by p = 1; 200 2Y. The corresponding cost functions are c 1 (y 1 ) = y 2 1 and c 2

Nash Equilibria, Two people are engaged in a joint project. If each person ...

Two people are engaged in a joint project. If each person i puts in the effort xi, the outcome of the project is worth f(x1, x2). Each person’s effort level xi is a number between

Normal kind, The normal kind may be a matrix illustration of a simultaneous...

The normal kind may be a matrix illustration of a simultaneous game. For 2 players, one is that the "row" player, and also the different, the "column" player. Every rows or column

Prisoners'' dilemma scenario, Scenario Two conspirators are arrested an...

Scenario Two conspirators are arrested and interrogated separately. If one implicates the opposite, he might go free whereas the opposite receives a life sentence. Yet, if each

Bayes rule, Treating probability as a logic, Thomas Bayes defined the follo...

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

Japanese auction, A type of sequential second worth auction, just like an E...

A type of sequential second worth auction, just like an English auction during which an auctioneer frequently raises the present worth. Participants should signal at each worth lev

Non-cooperative game , A non-cooperative game is one during which players a...

A non-cooperative game is one during which players are unable to form enforceable contracts outside of these specifically modeled within the game. Hence, it's not outlined as games

nim game, Matches or different objects are organized in 2 or a lot of pile...

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

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

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