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

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.

Cournot Game, I have a problem with an exercise about Cournot game. It is v...

I have a problem with an exercise about Cournot game. It is very complex and it is composed by different question and it is impossible for me to write the complete text. I need som

Perfect data, A sequential game is one among one in all if just one player ...

A sequential game is one among one in all if just one player moves at a time and if every player is aware of each action of the players that moved before him at every purpose. Tech

Compute the nash equilibrium, Consider two quantity-setting firms that prod...

Consider two quantity-setting firms that produce a homogeneous good. The inverse demand function for the good is p = A - (q 1 +q 2 ). Both firms have a cost function C = q 2 (a

All-pay auction, A type of auction in which the highest bidder is rewarded ...

A type of auction in which the highest bidder is rewarded the object, but all bidders pay the auctioneer their bids. This differs from traditional first price auctions in which onl

Extensive games with sumultaneous moves, consider the three player game in ...

consider the three player game in question 2 in assignment 1. Assume now that player 3 moves first. Players 1 and 2

Game:claim a pile of dimes, GAME 1 Claim a Pile of Dimes Two players A...

GAME 1 Claim a Pile of Dimes Two players Aand B are chosen. The instructor places a dime on the table. Player A can say Stop or Pass. If Stop, then A gets the dime and the gam

Hicks, Winner of the Nobel Prize in 1972, Hicks is acknowledged mutually of...

Winner of the Nobel Prize in 1972, Hicks is acknowledged mutually of the leading economists normally equilibrium theory. he's credited with the introduction of the notion of elasti

Sealed bid auction, An auction during which bidders simultaneously submit b...

An auction during which bidders simultaneously submit bids to the auctioneer while not information of the number bid by different participants. Usually, the very best bidder (or lo

All pure nash equilibrium for strategic form game, write a program in c tha...

write a program in c that takes n number finite players using gambit format and output is to be all pure strategy nash equilibrium

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