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
what will be the best strategy for a bidder in an auction comprised of four bidders?

Two people are engaged in a joint project. If each person i puts in the effort xi, the outcome of the project is worth f(x1, x2). Each person’s effort level xi is a number between

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

Tower defense - is a subgenre of real-time strategy games. The goal of tower defense games is to try to stop enemies from crossing a map by building towers which shoot at them as t

. A bid is an sign by a potential buyer of the price the buyer is ready to pay for the object being auctioned. In a Procurement Auction, the bid is an sign of the price a seller is

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

A mixed strategy during which the player assigns strictly positive chance to each pure strategy.Morgenstern, Oskar,Coauthor of Theory of Games and Economic Behavior with John von N

A class of games of imperfect data during which one player (the principal) tries to supply incentives to the opposite (the agent) to encourage the agent to act within the principal

QUESTION ONE. (a) The probability that, a bomber hits a target on a bombing mission is 0.70 Three bombers are sent to bomb a particular target. (i)  What is the probabilit

Find the pure-strategy Nash equilibrium Alice is on vacation in Wonderland and considers trying a special mushroom sold by the caterpillar. She cannot tell upfront if the mush