Assurance game scenario, Game Theory

Assignment Help:

"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 hunters can moreover jointly hunt a stag (an adult deer and quite large meal) or individually hunt a rabbit (tasty, but significantly less filling). Hunting stags is quite difficult and need mutual cooperation. If either hunts a stag alone, the chance of victory is negligible. Hunting stags is most advantageous for society but needs a ample of trust amid its members.

Description

 

There are two pure policy equilibria. Both players favor one equilibrium to the other - it is both Pareto optimal and Hicks optimal. However, the incompetent equilibrium is less risky as the payoff variance over the other player's strategies is lower. Specifically, one equilibrium is payoff-dominant while the other is risk-dominant.

Example


Firm 2

 



invest

don't

Firm 1

invest

10,10

-50,0

don't

0,-50

0,0

General Form



Player 2



L

R

Player 1

U

I,V

II,VI

D

III,VII

IV,VIII

Where the following relations hold:
I> III >= IV > II 
V > VI >= VIII> VII

 


Related Discussions:- Assurance game scenario

Equilibrium, An equilibrium, (or Nash equilibrium, named when John Nash) ma...

An equilibrium, (or Nash equilibrium, named when John Nash) may be a set of methods, one for every player, such that no player has incentive to unilaterally amendment her action. P

Yankee auction, Yankee auction typically implies a multiunit discriminatory...

Yankee auction typically implies a multiunit discriminatory English auction. not like a Vickrey auction where every winning bidder pays identical worth for every unit, in a very ya

Game of nim, Matches or different objects are organized in 2 or a lot of pi...

Matches or different objects are organized in 2 or a lot of piles. Players alternate removing some or all of the matches from anyone pile. The player to get rid of the last match w

Order condition for identification, This condition is based on a counting ...

This condition is based on a counting rule of the variables included and excluded from the particular equation. It is a necessary but no sufficient condition for the identi

Cournot Game, I have a problem with an exercise about Cournot game. It is v...

I have a problem with an exercise about Cournot game. It is very complex and it is composed by different question and it is impossible for me to write the complete text. I need som

Find the nash equilibria of game - bimatrix of strategies, Players 1 and 2 ...

Players 1 and 2 are bargaining over how to split one dollar. Both players simultaneously name shares they would like to keep s 1 and s 2 . Furthermore, players' choices have to be

Single unit auction, An auction during which just one item is on the market...

An auction during which just one item is on the market for sale. Procedures embody English, Dutch, and sealed bid auctions. When multiple units are sold in one auction, the auction

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

Zero sum, A zero add game may be a special case of a continuing add game du...

A zero add game may be a special case of a continuing add game during which all outcomes involve a add of all player's payoffs of zero. Hence, a gain for one participant is usually

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.

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