Matching pennies, Game Theory

Assignment Help:

 Matching Pennies Scenario

To determine who is needed to try to to the nightly chores, 2 youngsters initial choose who are represented by "same" and who are represented by "different." Then, every kid conceals in her palm a penny either with its face up or face down. each coins are revealed simultaneously. If they match (both are heads or each are tails), the kid "same" wins. If they're totally different (one heads and one tails), "different" wins. the sport is corresponding to "odds or evens" and quite just like a 3 strategy version - rock, paper, scissors.

Description

The game is zero add. the sole equilibrium is in mixed methods. every plays every strategy with equal chance, leading to an expected payoff of zero for every player

Example



same



heads

tails

different

heads

-1,1

1,-1

tails

1,-1

-1,1

General Form



Player 2



L

R

Player 1

U

a,w

b,x

D

c,y

d,z

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

 


Related Discussions:- Matching pennies

Asynchrony, In a repeated game it is often unspecified that players move co...

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

Zero restriction, A priori knowledge usually enables us to decide that some...

A priori knowledge usually enables us to decide that some coefficients must be zero in the particular equation, while they assume non-zero values in other equations of the system.

Assurance game, Assurance game Scenario "Assurance game" may be a generi...

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 subse

Bidding increment, A bidding increment is defined by the auctioneer as the ...

A bidding increment is defined by the auctioneer as the least amount above the previous bid that a new bid must be in order to be adequate to the auctioneer. For example, if the in

Perfect data, A sequential game is {one of|one among|one in all|one amongst...

A sequential game is {one of|one among|one in all|one amongst|one in each of} excellent data if just one player moves at a time and if every player is aware of each action of the p

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

Bid rigging, A practice analogous to price fixing in which auction members ...

A practice analogous to price fixing in which auction members form a ring whose associates agree not to bid against each other, either by discarding the auction or by placing phony

Quiz to generate a grid, 1.a.out 2 1 Here is the grid that has been gene...

1.a.out 2 1 Here is the grid that has been generated: 1 1 1 0 0 0 0 0 1 1 0 1 0 0 1 1 1 1 0 0 1 1 1 1 0 1 1 0 0 1 1 0 0 1 0 1 1 1 1 1 1 0 1 0 1 1 0 1 0 1 1 1 0

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

Rollback , Rollback (often referred to as backward induction) is an iterati...

Rollback (often referred to as backward induction) is an iterative method for solving finite in depth kind or sequential games. First, one determines the optimal strategy of the pl

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