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
A strategy sometimes applied to repeated prisoner's dilemmas during which a player begins by cooperating however defects to cheating for a predefined amount of your time as a respo


A collection of colluding bidders. Ring members comply with rig bids by agreeing to not bid against one another, either by avoiding the auction or by putting phony (phantom) bids

In any game, payoffs are numbers that represent the motivations of players. Payoffs might represent profit, quantity, "utility," or different continuous measures (cardinal payoffs)

saaaaaaasfffffffffffffffffffaaaczzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz

Problem:-Two players take turns choosing a number between 1 and 10 (inclusive), and a cumulative total of their choices is kept. The player to take the total exactly to 100 is the

For the section on dynamic games of competition, you can begin by asking if anyone in the class has played competi- tive tennis (club or collegiate or better); there is usually one

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

QUESTION ONE. (a) The probability that, a bomber hits a target on a bombing mission is 0.70 Three bombers are sent to bomb a particular target. (i)  What is the probabilit

A general term for an English auction in which there is no reserve price, guaranteeing that the object will be sold to the highest bidder regardless of the quantity of the bid.