Game playing in class:adding numbers—win at 100, Game Theory

GAME PLAYING IN CLASS GAME 1 Adding Numbers—Win at 100

This game is described in Exercise 3.7a. In this version, two players take turns choosing a number between 1 and 10 (inclusive), and a cumulative total of their choices is kept. The player to take the total exactly to 100 is the winner.The first pair starts by choosing numbers more or less at  taking the total successively to 12, 23, . . ., 78, 89, 100. You can hold a brief discussion and build this insight into the general idea of backward induction. You can also point out how the equilibrium strategy is a complete plan of action.

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







Related Discussions:- Game playing in class:adding numbers—win at 100, Assignment Help, Ask Question on Game playing in class:adding numbers—win at 100, Get Answer, Expert's Help, Game playing in class:adding numbers—win at 100 Discussions

Write discussion on Game playing in class:adding numbers—win at 100
Your posts are moderated
Related Questions
how do tron legacy made?

Two individuals (i ∈ {1, 2}) work independently on a joint project. They each independently decide how much e ort ei they put. E ort choice has to be any real number between 0 and

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

An equilibrium refinement provides how of choosing one or many equilibria from among several in a very game. several games might contain many Nash equilibria, and therefore supply

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 a bouncing ball video game. The game is similar to the one described and depicted in The balls bounce within the screen where the two horizontal walls are fixed. The two v

Twentieth century mathematician who expanded on earlier fastened purpose theorems. a hard and fast purpose theorem defines the conditions on a perform, f(x), beneath that there exi

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 cumulati

Scenario The French thinker, Jean Jacques Rousseau, presented the subsequent state of affairs. 2 hunters will either jointly hunt a stag (an adult deer and rather massive meal)

(a) Equilibrium payoffs are (1, 0). Player A’s equilibrium strategy is S; B’s equilibrium strategy is “t if N.”   For (a): Player A has two strategies: (1) N or (2) S. P