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

Formal rules for identification, Identification may be established either ...

Identification may be established either by the examination of the specification of the structural model, or by the examination of the reduced form of the model. Traditionally

Status of identification, In econometric theory two possibie situations of ...

In econometric theory two possibie situations of identifiability can arise: Equation under,consideration is identified or not identified: 1) Equation is under-identified-

Two person, On a picnic outing, 2 two-person teams are playing hide-and-see...

On a picnic outing, 2 two-person teams are playing hide-and-seek. There are four hiding locations (A, B, C, and D), and the two members of the hiding team can hide separately in a

Ordinally symmetric game, Ordinally Symmetric Game Scenario Any game dur...

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

Weakly dominant strategy , A strategy is weakly dominant if, no matter what...

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

First price auction, Two individuals, Player 1 and Player 2, are competing ...

Two individuals, Player 1 and Player 2, are competing in an auction to obtain a valuable object. Each player bids in a sealed envelope, without knowing the bid of the other player.

Perfect data, A sequential game is {one of|one among|one in all|one amongst...

A sequential game is {one of|one among|one in all|one amongst|one in each of} excellent data if just one player moves at a time and if every player is aware of each action of the p

equilibrium refinement, An equilibrium refinement provides how of choosing...

An equilibrium refinement provides how of choosing one or many equilibria from among several in a very game. several games might contain many Nash equilibria, and therefore supply

Bayesian game and find its bayesian equilibria, Two people are involved in ...

Two people are involved in a dispute. Person 1 does not know whether person 2 is strong or weak; she assigns probability to person 2 being strong. Person 2 is fully informed. Each

Nash equilibrium - pay off, The following is a payoff matrix for a non-coop...

The following is a payoff matrix for a non-cooperative simultaneous move game between 2 players. The payoffs are in the order (Player 1; Player 2): What is the Nash Equilibri

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