15 Game Theory

Player2 c dnc c 66 09 player1 dnc 90 11 8

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Prisoner’s Dilemma Game ► 2. Eliminate Strictly Dominated Strategies (Player 1’s Strategy if Player 2 Does Not Confess) If Player 2 DNC and Player 1 C, Player 1 gets 0 years. If Player 2 DNC and Player 1 DNC, Player 1 gets 1 year in jail. If Player 2 is going to Not Confess, # of years in jail if Player 1 C < # of years in jail if Player 1 DNC Thus if Player 1 thinks Player 2 does not confess, Player 1 is better off confessing. Player 2 C DNC C ­6 , ­6 0 , ­9 Player 1 DNC ­9 , 0 ­1 , ­1 8 Prisoner’s Dilemma Game ► 2. Eliminate Strictly Dominated Strategies (Player 1’s Dominant Strategy) If Player 2 C, Player 1 is better off confessing. If Player 2 DNC, Player 1 is better off confessing. Regardless of what Strategy Player 2 use...
View Full Document

Ask a homework question - tutors are online