Find pure nash equilibria, Game Theory

Assignment Help:

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


Related Discussions:- Find pure nash equilibria

Asynchrony, In a repeated game it is often unspecified that players move co...

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

What are the important forms of product differentiation, What are the impor...

What are the important forms of product differentiation? There are three significant forms of product differentiation, which are: 1. Differentiation through style or type –

All pure nash equilibrium for strategic form game, write a program in c tha...

write a program in c that takes n number finite players using gambit format and output is to be all pure strategy nash equilibrium

Games with sequential moves, Games with Sequential Moves Most students ...

Games with Sequential Moves Most students find the idea of rollback very simple and natural, even without drawing or understanding trees. Of course, they start by being able to

Totally mixed strategy, A mixed strategy during which the player assigns st...

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

Japanese auction, A type of sequential second worth auction, just like an E...

A type of sequential second worth auction, just like an English auction during which an auctioneer frequently raises the present worth. Participants should signal at each worth lev

Probability and expected utility, PROBABILITY AND EXPECTED UTILITY Most...

PROBABILITY AND EXPECTED UTILITY Most students know the elementary combinatorial rules for probability algebra and need only a refresher with some exam- ples. We have used card

Hicks, Winner of the Nobel Prize in 1972, Hicks is acknowledged mutually of...

Winner of the Nobel Prize in 1972, Hicks is acknowledged mutually of the leading economists normally equilibrium theory. he's credited with the introduction of the notion of elasti

Pareto economical , Named when Vilfredo Pareto, Pareto potency (or Pareto o...

Named when Vilfredo Pareto, Pareto potency (or Pareto optimality) may be alive of potency. An outcome of a game is Pareto economical if there's no different outcome that produces e

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd