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

Auction, A market mechanism in which a service, objects, or set of objects,...

A market mechanism in which a service, objects, or set of objects, is swapped on the basis of bids submitted by member. Auctions offer a precise set of rules that will rule the pur

All-pay auction, A type of auction in which the highest bidder is rewarded ...

A type of auction in which the highest bidder is rewarded the object, but all bidders pay the auctioneer their bids. This differs from traditional first price auctions in which onl

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

Dominated strategy , A strategy is dominated if, no matter what the other p...

A strategy is dominated if, no matter what the other players do, the strategy earns a player a smaller payoff than another strategy. Hence, a method is dominated if it's invariably

Animal puzzle, a) This you just have to list all the attributes for the pro...

a) This you just have to list all the attributes for the program. i.e. unique id's for puzzle pieces, attributes for the puzzle like a data field for the number of edges, methods t

Consolidation, For the section on dynamic games of competition, you can beg...

For the section on dynamic games of competition, you can begin by asking if anyone in the class has played competi- tive tennis (club or collegiate or better); there is usually one

Determine the perfect sub game nash equilibrium, Consider the situation in ...

Consider the situation in which Player M is an INCUMBENT monopolist in an industry, which makes a profit of $10m if left to enjoy its privileged position undisturbed. Player P is a

Application of twenty one card game, This version of Twenty-one is a card g...

This version of Twenty-one is a card game played between a player and the dealer (the computer). The aim of the game is to accumulate a higher point total than the dealer but witho

Nash equilibrium - pay off, The following is a payoff matrix for a non-coop...

The following is a payoff matrix for a non-cooperative simultaneous move game between 2 players. The payoffs are in the order (Player 1; Player 2): What is the Nash Equilibri

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

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