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

Rollback equilibrium, Rollback equilibrium       (b) In t...

Rollback equilibrium       (b) In the rollback equilibrium, A and B vote For while C and D vote Against; this leads to payoffs of (3, 4, 3, 4). The complete equil

Mba , in a rectangular game pay off matrix of player a is as follows B1 B2 ...

in a rectangular game pay off matrix of player a is as follows B1 B2 A1 5 7 A2 4 0 salve the game write down the pay off matrix of B and then solve the game.

Formal rules for identification, Identification may be established either ...

Identification may be established either by the examination of the specification of the structural model, or by the examination of the reduced form of the model. Traditionally

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

Nash equilibrium, A Nash equilibrium, named when John Nash, may be a set of...

A Nash equilibrium, named when John Nash, may be a set of methods, one for every player, such that no player has incentive to unilaterally amendment her action. Players are in equi

Identifying restrictions, In many cases we are interested in only one (or a...

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

Static game, A static game is one during which all players build choices (o...

A static game is one during which all players build choices (or choose a strategy) simultaneously, while not information of the methods that are being chosen by different players.

Dominant strategy equilibrium, The following is a payoff matrix for a non-c...

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 the Dominant Strat

Reverse auction, While ancient auctions involve one seller and plenty of co...

While ancient auctions involve one seller and plenty of consumers, a reverse auction typically involves several sellers and one buyer. for instance, procurement auctions are used t

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

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