yale知识管理讲座(PPT45).pptVIP

Games of Perfect Information The information concerning an opponent’s move is well known in advance. All sequential move games are of this type. Imperfect Information Partial or no information concerning the opponent is given in advance to the player’s decision. Imperfect information may be diminished over time if the same game with the same opponent is to be repeated. Key Area of Interest chance strategy Matrix Notation Notes: Player Is strategy A may be different from Player IIs. P2 can be omitted if zero-sum game Prisoner’s Dilemma Other famous games A sample of other games: Marriage Disarmament (my generals are  more irrational than yours) Prisoner’s Dilemma Notes: Higher payoffs (longer sentences) are bad. Non-cooperative equilibrium ? Joint maximum NCE Jt. max. Games of Conflict Two sides competing against each other Usually caused by complete lack of information about the opponent or the game Characteristic of zero-sum games Games of Co-operation Players may improve payoff through communicating forming binding coalitions agreements do not apply to zero-sum games Prisoner’s Dilemma with Cooperation Prisoner’s Dilemma with Iteration Infinite number of iterations Fear of retaliation Fixed number of iteration Domino effect Basic Strategies 1. Plan ahead and look back 2. Use a dominating strategy if possible 3. Eliminate any dominated strategies 4. Look for any equilibrium 5. Mix up the strategies Plan ahead and look back If you have a dominating strategy, use it Use strategy 1 Eliminate any dominated strategy Eliminate strategy 2 as it’s dominated by strategy 1 Look for any equilibrium Dominating Equilibrium Minimax Equilibrium Nash Equilibrium Maximin Minimax Equilibrium Minimax - to minimize the maximum loss (defensive) Maximin - to maximize the minimum gain (offensive) Minimax = Maximin Maximin Minimax Equilibrium Strategies Definition: Nash Equilibrium “If there is a set of strategies with the property that n