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

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)

please compute this number 885 for the swertres lotto game.

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

Extraneous Estimates If some parameters are identified, while others are not and there exists information on their value from other (extraneous) sources, the researcher may pro

A simultaneous game is one during which all players build choices (or choose a strategy) while not information of the methods that are being chosen by different players. Although t

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

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

A strategy sometimes applied to repeated prisoner's dilemmas during which a player begins by cooperating however defects to cheating for a predefined amount of your time as a respo

saaaaaaasfffffffffffffffffffaaaczzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz