Assurance game, Game Theory

Assurance game Scenario

"Assurance game" may be a generic name for the sport a lot of commonly called "Stag Hunt." The French thinker, Jean Jacques Rousseau, presented the subsequent state of affairs. 2 hunters will either jointly hunt a stag (an adult deer and rather massive meal) or individually hunt a rabbit (tasty, however substantially less filling). searching stags is kind of difficult and needs mutual cooperation. If either hunts a stag alone, the prospect of success is minimal. searching stags is most useful for society however needs lots of trust among its members.

Description

There are 2 pure strategy equilibria. each players like one equilibrium to the opposite - it's each Pareto optimal and Hicks optimal. However, the inefficient equilibrium is a smaller amount risky because the payoff variance over the opposite player's methods is lower. Specifically, one equilibrium is payoff-dominant whereas the opposite 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

a,w

b,x

D

c,y

d,z

Where the following relations hold:
a > c >= d > b 
w > x >= z > y

 

Posted Date: 7/21/2012 4:00:06 AM | Location : United States







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

Write discussion on Assurance game
Your posts are moderated
Related Questions
Leadership in an Oil Production Game Students can be broken into pairs to play this game once, witheach student's representing one country; then each shouldswitch partners and

Explain about the term Game Theory. Game Theory: While the decisions of two or more firms considerably influence each others’ profits, in that case they are into a situation

In many cases we are interested in only one (or a few) of the equations of the model and attempts to measure its parameters statistically without a complete knowledge of the entire

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

A method by that players assume that the methods of their opponents are randomly chosen from some unknown stationary distribution. In every amount, a player selects her best respon

Ordinal payoffs are numbers representing the outcomes of a game where the worth of the numbers isn't vital, however solely the ordering of numbers. for instance, when solving for a

Games with Strat e gic M ov es   The ideas in this chapters can be brought to life and the students can better appreciate the subtleties of various strategic moves an

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

1. The town of Sunnydale, CA is inhabited by two vampires, Spike and Anya. Each night Spike and Anya independently hunt for food, which each one finds with probability 1/2 . Becaus

Scenario As described by William Poundstone, imagine that you just notice that electricity has gone out for your entire neighborhood. the electrical company can send somebody to