Find the nash equilibria of game - bimatrix of strategies, Game Theory

Players 1 and 2 are bargaining over how to split one dollar. Both players simultaneously name shares they would like to keep s1 and s2. Furthermore, players' choices have to be in increments of 25 cents, that is, s1 ? {0, 0.25, 0.50, 0.75, 1.00} and s2 ? {0, 0.25, 0.50, 0.75, 1.00}. If s1+s2 < 1, then player 1 gets s1 and player 2 gets s2. If s1+s2 > 1, then both players get 0.

(1) Write down the normal form of the game (the bimatrix of strategies and payoffs).

(2) Find the Nash Equilibria of this game.

Posted Date: 3/23/2013 3:52:34 AM | Location : United States







Related Discussions:- Find the nash equilibria of game - bimatrix of strategies, Assignment Help, Ask Question on Find the nash equilibria of game - bimatrix of strategies, Get Answer, Expert's Help, Find the nash equilibria of game - bimatrix of strategies Discussions

Write discussion on Find the nash equilibria of game - bimatrix of strategies
Your posts are moderated
Related Questions
Find Pure Nash Equilibria 1. Consider a two-player game in which player 1 chooses the strategy x 1 from the closed interval [-1, 1] while player 2 chooses the strategy x 2 fr

Identification is a problem of model formultion, rather than inf nlnde! estimation or appraisal. We say a model is identified if it is in a unique statistical form, enabling unique

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

Rules of Snake Eyes (small variation on game called Craps in USA) Player rolls two dice. On the first roll if the total of the dice is 2 (snake eyes): player wins and rece

In a repeated game it is often unspecified that players move concurrently at predefined time intervals. However, if few players update their policies at different time intervals, t

A type of initial worth auction during which a "clock" initially indicates a worth for the item for sale substantially beyond any bidder is probably going to pay. Then, the clock g


A pure strategy defines a selected move or action that a player can follow in each potential attainable state of affairs in a very game. Such moves might not be random, or drawn fr

A game is one among complete data if all factors of the sport are common information. Specifically, every player is awake to all different players, the timing of the sport, and als

A zero add game may be a special case of a continuing add game during which all outcomes involve a add of all player's payoffs of zero. Hence, a gain for one participant is usually