Find pure nash equilibria, Game Theory

Find Pure Nash Equilibria

1. Consider a two-player game in which player 1 chooses the strategy x1 from the closed interval [-1, 1] while player 2 chooses the strategy x2 from the same closed interval [-1, 1]. Player 1's utility function is x21/2 + x1x2 and player 2's utility function is x2 2/2 - x1x2. Find and plot the best- response function of each player (against any pure strategy of the opponent). Is there a pure strategy Nash equilibrium of the game?

2. 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 for player 3 against any combination of (mixed) strategies of players 1 and 2. However, prove that D is not dominated by any (mixed) strategies of player 3.

1561_find all pure Nash Equilibria 1.png

3. Consider the following three-player game and find all pure Nash Equilibria. Can you find any Nash equilibrium in which exactly two of the three players play a pure strategy while the other plays a mixed strategy (such as (B, R, ½X ½Y)). Explain by considering all possible cases.

2288_find all pure Nash Equilibria 2.png

4. Show that the following game has two types of NE: (i) player 1 chooses D, 2 chooses C with probability at least 1/3 and player 3 chooses L, and (ii) where player 1 chooses C, player 2 chooses C and 3 chooses R with probability at least ¾.

1360_find all pure Nash Equilibria 3.png

Posted Date: 2/15/2013 12:15:12 AM | Location : United States

Related Discussions:- Find pure nash equilibria, Assignment Help, Ask Question on Find pure nash equilibria, Get Answer, Expert's Help, Find pure nash equilibria Discussions

Write discussion on Find pure nash equilibria
Your posts are moderated
Related Questions
A market mechanism during which an object, service, or set of objects is being purchased, instead of sold, to the auctioneer. The auction provides a selected set of rules which wil

GAME 1 Claim a Pile of Dimes Two players Aand B are chosen. The instructor places a dime on the table. Player A can say Stop or Pass. If Stop, then A gets the dime and the gam

A sealed-bid second worth auction during which participants every simultaneously submit bids. The auctioneer discloses the identity of the very best bidder who is said the winner.

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

An outcome of a game is Pareto dominated if another outcome would build a minimum of one player at an advantage while not hurting the other player. That is, another outcome is weak

Two people are engaged in a joint project. If each person i puts in the e ort xi, a nonnegative number equal to at most 1, which costs her c(x i ), the outcome of the project is wo

Game 1 Color Coordination (with Delay) This game should be played twice, once without the delay tactic and once with it, to show the difference between out- comes in the s

Ordinally Symmetric Game Scenario Any game during which the identity of the player doesn't amendment the relative order of the ensuing payoffs facing that player. In different w

Game Theory has evolved since its start as a thought exercise for academic mathematicians. Taught in economics departments , top business schools, and the strategic analysis, even

Normal 0 false false false EN-US X-NONE X-NONE