Assurance game scenario, Game Theory

"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

 

Posted Date: 7/21/2012 5:23:01 AM | Location : United States







Related Discussions:- Assurance game scenario, Assignment Help, Ask Question on Assurance game scenario, Get Answer, Expert's Help, Assurance game scenario Discussions

Write discussion on Assurance game scenario
Your posts are moderated
Related Questions
Two individuals (i ∈ {1, 2}) work independently on a joint project. They each independently decide how much e ort ei they put. E ort choice has to be any real number between 0 and

About assignment The goal of this assignment is for the student to propose a new game of your own and to be able to present their ideas in clear and convincing manner. This pro

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

In a repeated game it is often unspecified that players move concurrently at predefined time intervals. However, if few players update their policies at different time intervals, t

A sequential game is one among imperfect data if a player doesn't grasp precisely what actions different players took up to that time. Technically, there exists a minimum of one da

Consider the following three games (Chicken, Matching Pennies, Stag Hunt): Chicken Player 2 Player 1 D V D -100;-100 10;-10 V -10; 10 -1;-1 Matching Pennies Pla

Cardinal payoffs are numbers representing the outcomes of a game where the numbers represent some continuum of values, such as money, market share or quantity. Cardinal payoffs per

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

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

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/are the Nash Equil