fighting for survival, Game Theory

Assignment Help:
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 they both act aggressively (hawkish) and get into a fight, they split the prey in two equal parts but suffer the cost of fighting. If both act peacefully (dovish) then they also split the prey in two equal parts but without incurring any cost. If one acts dovish and the other hawkish, there is no fight and the hawkish gets the prey.
(2.1) Write down the normal form of the game (the bimatrix of strategies and payoffs).
(2.2) Find the Nash Equilibria for all possible parameter configurations and given the following restrictions: v > 0, c1 > c2 > 0, v ?= 2c1 and v ?= 2c2.

Related Discussions:- fighting for survival

Determine nash equilibria, Consider the electoral competition game presente...

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

Backward induction, Backward induction is an iterative procedure for resolv...

Backward induction is an iterative procedure for resolving finite general form or sequential games. First, one decides the finest policy of the player who makes the last move of th

Grim trigger strategy, A trigger strategy sometimes applied to repeated pri...

A trigger strategy sometimes applied to repeated prisoner's dilemmas during which a player begins by cooperating within the initial amount, and continues to cooperate till one defe

Zero restriction, A priori knowledge usually enables us to decide that some...

A priori knowledge usually enables us to decide that some coefficients must be zero in the particular equation, while they assume non-zero values in other equations of the system.

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

Find the shortest sequence of moves that is to win the game, You and an opp...

You and an opponent are seated at a table, and on the table is a square board. At each of the four corners of the board, there is a disc, each one red on one side and black on the

Two player problem of points set up - game theory, a) Show that A c...

a) Show that A counting proof could be fun(?). But any old proof will do. (Note that the coefficients (1,2,1) in the above are just the elements of the second row of Pas

Sequential game, A sequential game is one during which players build choice...

A sequential game is one during which players build choices (or choose a strategy) following an exact predefined order, and during which a minimum of some players will observe the

Bayes rule, Treating probability as a logic, Thomas Bayes defined the follo...

Treating probability as a logic, Thomas Bayes defined the following: Pr(X|Y)=Pr(Y|X)Pr(X)/Pr(Y) For example, probability that the weather was bad given that our friends playe

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