Find the nash equilibria - strategic game, Game Theory

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(xi), the outcome of the project is worth f(x1; x2). The worth of the project is split equally between the two people, regardless of their effort levels.

(a) Formulate this situation as a strategic game.

(b) Find its Nash equilibria when i. f(x1; x2) = 3x1x2, c(xi) = x2i , for i = 1; 2.

ii. f(x1; x2) = 4x1x2, c(xi) = xi, for i = 1; 2.

(c) In each case, is there a pair of e ort levels that yields both players higher payoffs than the Nash equilibrium e ort levels?


Posted Date: 3/23/2013 4:01:09 AM | Location : United States

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

Write discussion on Find the nash equilibria - strategic game
Your posts are moderated
Related Questions
Explain oligopoly's structure and use game theory to explain why oligopoly firms tend not to use price to compete. Answer- Oligopoly is an imperfect market where there are

Two animals are fighting over a prey. The prey is worth v to each animal. The cost of fighting is c1 for the first animal (player 1) and c2 for the second animal (player 2). If the

In any game, payoffs are numbers that represent the motivations of players. Payoffs might represent profit, quantity, "utility," or different continuous measures (cardinal payoffs)

The ideas underlying game theory have appeared throughout history, apparent within the bible, the Talmud, the works of Descartes and Sun Tzu, and also the writings of Chales Darwin

"Assurance game" is a general name for the game more commonly known as "Stag Hunt." The French philosopher, Jean Jacques Rousseau, presented the subsequent circumstances. Two hunte

A game tree (also referred to as the in depth form) may be a graphical illustration of a sequential game. It provides data concerning the players, payoffs, strategies, and also the

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

A strategy is dominated if, no matter what the other players do, the strategy earns a player a smaller payoff than another strategy. Hence, a method is dominated if it's invariably