Determine nash equilibria, Game Theory

Consider the electoral competition game presented in Lecture 6. In this game there are two candidates who simultaneously choose policies from the real line. There is a distribution of voters with median m and the candidate whose policy is closest to the median wins the election and the winning candidate's policy is implemented. If the two candidates are an equal distance from the median, then the average of the two policies is implemented. For this problem we suppose that both candidates care about both the implemented policy and winning the election. That is, the payo to each candidate has two parts. The first part is the utility from the implemented policy a*. That is, each candidate has utility u(a* ; xi), where xi is the ideal policy of candidate i and utility decreases to the left and right of xi. We suppose that xi < m < xj . The second part is the value of winning office, which we denote wi > 0 for candidate i. Putting these two parts together, we de ne the payoff to candidate i by

1068_Find all Nash equilibria.png

Find all Nash equilibria to this game.

Posted Date: 2/20/2013 2:04:43 AM | Location : United States

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

Write discussion on Determine nash equilibria
Your posts are moderated
Related Questions
Two individuals use a common resource (a river or a forest, for example) to produce output. The more the resource is used, the less output any given individual can produce. Denote

Rollback (often referred to as backward induction) is an iterative method for solving finite in depth kind or sequential games. First, one determines the optimal strategy of the pl

Rollback equilibrium       (b) In the rollback equilibrium, A and B vote For while C and D vote Against; this leads to payoffs of (3, 4, 3, 4). The complete equil

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

what will be the best strategy for a bidder in an auction comprised of four bidders?

A method by that players assume that the methods of their opponents are randomly chosen from some unknown stationary distribution. In every amount, a player selects her best respon

A subset or piece of a sequential game starting at some node such {that each that each} player is aware of each action of the players that moved before him at every purpose. Sub ga

The interaction among rational, mutually aware players, where the choices of some players impacts the payoffs of others. A game is described by its players, every player's methods,

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

A strategy is weakly dominant if, no matter what the other players do, the strategy earns a player a payoff a minimum of as high as the other strategy, and, the strategy earns a st