Game:adding numbers—lose if go to 100 or over (win at 99), Game Theory

GAME Adding Numbers—Lose If Go to 100 or Over (Win at 99)

 
In the second ver- sion, two players again take turns choosing a number be- tween 1 and 10 (inclusive), and a cumulative total of their choices is kept. This time, the player who causes the total to equal or exceed 100 is the loser.

The first pair starts by choosing numbers more or less at random, until the total drifts into the 90s and the player with the next turn clinches a win by taking the total to 99. The second (or maybe third) time you play, when the total gets somewhere in the 80s, one of that pair will realize that she wins if she takes the total to 88. When she does that, the other will (probably) realize that she has lost, and as she concedes, the rest of the class will realize it, too. The next pair will quickly settle into subgame-perfect play as in the first version. Eventually everyone will have figured out that starting at 0 (being the first mover) guarantees not a win but a loss. In this version of the game, it is better to go second: let the first player choose any number and then say 11 minus what the other says. Here, the second player takes the total succes- sively to 11, 22, . . ., 77, 88, 99; the first player must then take the total to 100 (or more) and lose. You can hold a brief discussion comparing the two versions of the game; this helps make the point about order advantages in different games.

Posted Date: 9/27/2012 1:29:20 AM | Location : United States







Related Discussions:- Game:adding numbers—lose if go to 100 or over (win at 99), Assignment Help, Ask Question on Game:adding numbers—lose if go to 100 or over (win at 99), Get Answer, Expert's Help, Game:adding numbers—lose if go to 100 or over (win at 99) Discussions

Write discussion on Game:adding numbers—lose if go to 100 or over (win at 99)
Your posts are moderated
Related Questions
A bid that indicates totally different costs for various quantitites of the item offered for sale. A series of price-quantity mixtures is tendered to the auctioneer.

Players 1 and 2 are bargaining over how to split one dollar. Both players simultaneously name shares they would like to keep s 1 and s 2 . Furthermore, players' choices have to be

A sub game excellent Nash equilibrium is an equilibrium such that players' methods represent a Nash equilibrium in each sub game of the initial game. it should be found by backward

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

In econometric theory two possibie situations of identifiability can arise: Equation under,consideration is identified or not identified: 1) Equation is under-identified-

Consider a game in which player 1 chooses rows, player 2 chooses columns and player 3 chooses matrices. Only Player 3''s payoffs are given below. Show that D is not a best response

Scenario Two hooligans with one thing to prove drive at one another on a slender road. the primary to swerve loses faces among his peers. If neither swerves, however, a terminal

Experimental economics is bothered with utilizing laboratory experiments to realize understanding of how cognition, memory, and heuristics have an effect on behavior of individuals

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

Matching Pennies Scenario To determine who is needed to try to to the nightly chores, 2 youngsters initial choose who are represented by "same" and who are represented by "diffe