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

Uniform worth, A uniform worth auction may be a multiunit auction during wh...

A uniform worth auction may be a multiunit auction during which each winning bidder pays identical worth, which can or might not be equal to the participants' bids. Alternatively,

Draw a table representing the prisoner.s dilemma game, 1. (a) True or False...

1. (a) True or False: If a 2x2 game has a unique pure strategy Nash Equilibrium, then both players always have dominant strategies. (b) Draw a table representing the Prisoner.s Dil

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.

Game:adding numbers—lose if go to 100 or over (win at 99), GAME Adding Numb...

GAME Adding Numbers—Lose If Go to 100 or Over (Win at 99)   In the second ver- sion, two players again take turns choosing a number be- tween 1 and 10 (inclusive), and a cumulati

Green –beard strategy, 1  A, Explain how a person can be free to choose but...

1  A, Explain how a person can be free to choose but his or her choices are casually determined by past event 2  B , Draw the casual tree for newcomb's problem when Eve can't pe

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

Game theory equilibrium exercise, Exercise 1 a) Pure strategy nash equi...

Exercise 1 a) Pure strategy nash equilibrium in this case is Not Buy, bad ( 0,0) as no one wants to deviate from this strategy. b) The player chooses buy in the first perio

Schedule bid , A bid that indicates totally different costs for various qua...

A bid that indicates totally different costs for various quantitites of the item offered for sale. A series of price-quantity mixtures is tendered to the auctioneer.

Paradox of identification, Discussion in the preceding section suggests tha...

Discussion in the preceding section suggests that if we want to measure a given hnction belonging to a simultaneous-equations model, the hnction must be fairly stable over the samp

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