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

Quiz to generate a grid, 1.a.out 2 1 Here is the grid that has been gene...

1.a.out 2 1 Here is the grid that has been generated: 1 1 1 0 0 0 0 0 1 1 0 1 0 0 1 1 1 1 0 0 1 1 1 1 0 1 1 0 0 1 1 0 0 1 0 1 1 1 1 1 1 0 1 0 1 1 0 1 0 1 1 1 0

Find a bayesian nash equilibrium, In Bontemps, Louisiana there are only two...

In Bontemps, Louisiana there are only two places to spend time: Merlotte's bar and Fangtasia. Sookie and Eric have made plans to spend Friday night together, but they never decided

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

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

Imperfect data, A sequential game is one among imperfect data if a player d...

A sequential game is one among imperfect data if a player doesn't grasp precisely what actions different players took up to that time. Technically, there exists a minimum of one da

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

Free rider / free riding , The notion that those that don't contribute to s...

The notion that those that don't contribute to some project might nevertheless get pleasure from it (free riders), evidenced in games like the tragedy of the commons and public pro

Full equilibrium strategy example, (a) A player wins if she takes the tota...

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

Combining simultaneous and sequential moves, Combining Simultaneous and...

Combining Simultaneous and  Sequential Moves The material in this chapter covers a variety of issues that require some knowledge of the analysis of both sequential- move

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