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

Perfect nash equilibrium, Perfect Nash equilibrium Two students prepar...

Perfect Nash equilibrium Two students prepare their homework assignment together for a course. They both enjoy getting high grade for their assignment, but they dislike workin

Strategic kind, The strategic (or normal) kind may be a matrix illustration...

The strategic (or normal) kind may be a matrix illustration of a simultaneous game. for 2 players, one is that the "row" player, and also the different, the "column" player. every

Airline ticket, why might an airline offer the following deal: you pay 400 ...

why might an airline offer the following deal: you pay 400 for a round trip ticket from here to orlando, but you only pay 300 per ticket if you stayy in orlando includes a saturday

Find the perfect sub game nash equilibrium, Suppose that the incumbent mono...

Suppose that the incumbent monopolist, in the previous question, can decide (before anything else happens) to make an irreversible investment in extra Capacity (C), or Not (N). If

Coalitional game and matching markets, 1. This question and the next is bas...

1. This question and the next is based on the following description. Consider the coalitional game (referred to as Game 1) given by: N = {1,2,3,4}; v(N) = 3, v{i} = 0, i = 1,...,4,

Game 4 auctioning a penny jar (winner’s curse), GAME 4 Auctioning a Penny J...

GAME 4 Auctioning a Penny Jar (Winner’s Curse) Show a jar of pennies; pass it around so each student can have a closer look and form an estimate of the contents. Show the stud

Bidding ring, A set of colluding bidders. Ring participants agree to rig bi...

A set of colluding bidders. Ring participants agree to rig bids by agreeing not to bid against each other, either by avoiding the auction or by placing phony (phantom) bids.

How to make game, I wanna know the language to make games

I wanna know the language to make games

Discriminatory auction, A multiunit auction that during which within which ...

A multiunit auction that during which within which  each winning bidder pays a unique worth which depends on the particular bid placed by every winning participant. Alternatively,

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