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

All pure nash equilibrium for strategic form game, write a program in c tha...

write a program in c that takes n number finite players using gambit format and output is to be all pure strategy nash equilibrium

Pareto dominated, An outcome of a game is Pareto dominated if another outco...

An outcome of a game is Pareto dominated if another outcome would build a minimum of one player at an advantage while not hurting the other player. That is, another outcome is weak

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

Vickrey auction, A sealed-bid second worth auction during which participant...

A sealed-bid second worth auction during which participants every simultaneously submit bids. The auctioneer discloses the identity of the very best bidder who is said the winner.

Pareto economical , Named when Vilfredo Pareto, Pareto potency (or Pareto o...

Named when Vilfredo Pareto, Pareto potency (or Pareto optimality) may be alive of potency. An outcome of a game is Pareto economical if there's no different outcome that produces e

Evolutionary game theory, Evolutionary game theory provides a dynamic frame...

Evolutionary game theory provides a dynamic framework for analyzing repeated interaction. Originally modeled when "natural models" of fitness, a population might contains folks gen

Nova, how do tron legacy made?

how do tron legacy made?

Subgame , A subset or piece of a sequential game starting at some node such...

A subset or piece of a sequential game starting at some node such {that each that each} player is aware of each action of the players that moved before him at every purpose. Sub ga

Find the quantities that firm is selling – equilibrium price, 1. Two firms,...

1. Two firms, producing an identical good, engage in price competition. The cost functions are c 1 (y 1 ) = 1:17y 1 and c 2 (y 2 ) = 1:19y 2 , correspondingly. The demand functi

Fixed worth auction, Not technically an auction, however a posted-price pro...

Not technically an auction, however a posted-price procedure during which the auctioneer sets a worth and sells to the primary bidder willing to pay it. The auction ends as soon as

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