Combining simultaneous and sequential moves, Game Theory

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 and simultaneous-move games. Only one section deals with mixed strategies, so it is possible to present most of the material here after having introduced simultaneous-move games but before introducing mixing. We have used this approach in our own teaching.

To address rule changes in games, you will want to draw on examples used in previous class periods. We focus on the different outcomes that can arise when rules are changed. When a game is changed from simultaneous move to sequential move, for example, the change can create a first or second mover advantage. Games like the battle of the two cultures or chicken have first-mover advantages in their sequential move versions; the tennis-point example has a second-mover advantage in its sequential-move version. Other games show no change in equilibrium as a result of the change in rules; games like the prisoners' dilemma, in which both players have dominant strategies, fall into this category.

Similarly, changing a game from sequential play to simul- taneous play can mean that new equilibria arise-either multiple equilibria or equilibria in mixed strategies. Use the sequential-game examples you used to convey the material to show that there might be additional equilibria in the simultaneous-move versions of the game. This works for the tennis-point game if you teach it as a sequential game or for the three-person voting example from Ordeshook.

The most interesting component of the analysis is the representation of sequential-move games in strategic form and the solution of such games from that form. The second (and third) mover's strategies are more complex in sequential games, and the payoff table must have adequate rows (or columns or pages) to accommodate all of the pos- sible contingent strategies available to players. Again, the tennis-point or voting examples can be used to illustrate this idea. One nice exercise is to assert the existence of a new number of Nash equilibria in the strategic form and to show how one or two of these qualify as Nash equilibria; then use successive elim- ination of dominated strategies on the game to arrive at one cell of the table as the single reasonable equilibrium of the game. This helps motivate the idea of subgame perfection. Once you have shown that there may be multiple equilibria but that you can reduce the set of possible equilibria to one by eliminating (weakly) dominated strategies, you can show that the strategies associated with that one equilibrium coin- cide with the strategies found using rollback on the extensive form of the game. Students often have difficulty grasping the idea that the eliminated equilibria are unreasonable be- cause of the strategies associated with them rather than because of the (often) lower payoffs going to the players, so you will want to reinforce this idea as often as possible.

In addition to the examples used in previous chapters, you might want to make use of the game. This game can be played using either simultaneous or sequential moves, and there are several ways in which the sequential-move game can be set up; thus you have an opportunity to discuss rule changes as well as order changes. Also, the Boeing-Airbus example from can be used to show how multiple equilibria can arise when sequential-play games are repre- sented in strategic form. This is another way to show, with a smaller payoff table, that all subgame-perfect equilibria areNash equilibria but that not all Nash equilibria are subgame perfect. This example is also useful for explaining why Boeing's threat to fight if Airbus enters is not credible. This concept will be developed in more detail and used extensively in Chapter 9, so it is useful to introduce it before.

Posted Date: 9/27/2012 4:26:51 AM | Location : United States







Related Discussions:- Combining simultaneous and sequential moves, Assignment Help, Ask Question on Combining simultaneous and sequential moves, Get Answer, Expert's Help, Combining simultaneous and sequential moves Discussions

Write discussion on Combining simultaneous and sequential moves
Your posts are moderated
Related Questions
In a Variable add game, the add of all player's payoffs differs counting on the methods they utilize. this can be the other of a continuing add game during which all outcomes invol

Named when Vilfredo Pareto, Pareto optimality may be alive of potency. An outcome of a game is Pareto optimal if there's no different outcome that produces each player a minimum of

1. This question and the next is based on the following description. Consider the coalitional game (referred to as Game 1) given by: N = {1,2,3,4}; v(N) = 3, v{i} = 0, i = 1,...,4,

An auction during which bidders simultaneously submit bids to the auctioneer while not information of the number bid by different participants. Usually, the very best bidder (or lo

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

Backward induction is an iterative procedure for resolving finite general form or sequential games. First, one decides the finest policy of the player who makes the last move of th

To give Mom a day of rest, Dad Plans to take his two children, Bart and Cassie, on an outing on Sunday.Bart prefers to go to the amusement park (A), Whereas Cassie prefers to go to

PROBABILITY AND EXPECTED UTILITY Most students know the elementary combinatorial rules for probability algebra and need only a refresher with some exam- ples. We have used card

A sequential game is one among one in all if just one player moves at a time and if every player is aware of each action of the players that moved before him at every purpose. Tech

Two people are involved in a dispute. Person 1 does not know whether person 2 is strong or weak; she assigns probability to person 2 being strong. Person 2 is fully informed. Each