Game Theory 101 MOOC (#3): Iterated Elimination of Strictly Dominated Strategies

Game Theory 101: The Complete Textbook on Amazon: =as_li_ss_tl?ie=UTF8&camp=1789&creative=390957&creativeASIN=B005L7ANWC&linkCode=as2&tag=gamthe101-20 The prisoner’s dilemma had an obvious solution because each player had one strategy that was always the best regardless of what the other players do. Most games don’t have solutions that are that simple, however. What if one player’s best strategy depends entirely on which strategy the other player chose?