This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 6.254: Game Theory February 11, 2010 Lecture 4: Correlated Rationalizability Lecturer: Asu Ozdaglar 1 Correlated Rationalizability In this note, we allow a player to believe that the other players’ actions are correlated— in other words, the other players might be in a coalition and thus pick their strategies together instead of individually. To capture this idea, we slightly modify our definition of a belief. Definition 1.1 A belief of player i about the other players’ actions is a probability measure over the set S i , which we denote as Δ( S i ) . Note that we allow correlation in our belief. Recall, Δ( S ) denotes a probability distribu tion over S . One possible type of distribution is the product distribution S 1 × S 2 × ... × S I , which denotes independent mixing between the I players. In general however, the distribu tion Δ( S ) allows correlation in the strategies of players. Definition 1.2 An action s i ∈ S i is a rational action if there exists a belief α i ∈ Δ( S i ) such that s i is a best response to α i . To define rationalizable strategies, we eliminate actions that are not best responses to any belief, or in other words, we eliminate actions that are neverbest responses . Let us next recall the definitions of “neverbest response” strategy and “strictly dominated” strategy. Definition 1.3 1. An action s i is a neverbest response if for all beliefs α i there exists σ i ∈ Σ i such that u i ( σ i ,α i ) > u i ( s i ,α i ) . 2. An action s i is strictly dominated if there exists σ i ∈ Σ i such that u i ( σ i ,s i ) > u i ( s i ,s i ) for all s i ∈ S i . 41 It is straightforward to show that a strictly dominated action is a neverbest response. Does the other direction hold? We have shown in the previous lecture that it doesn’t hold if beliefs are independent mixings. In this lecture, we will show that this direction holds for correlated beliefs. 2 Strict Dominance & Correlated Rationalizability We first formally define the process of iterative elimination of strictly dominated strategies. Algorithm 2.1 (Strict Dominance Iteration) Let S i = S i and Σ i = Σ i . For each player i ∈ I and for each n ≥ 1 , we define S n i as S n i = { s i ∈ S n 1 i  there is no σ i ∈ Σ n 1 i such that u i ( σ i ,s i ) > u i ( s i ,s i ) for all s i ∈ S n 1 i } . Independently mix over S n i to get Σ n i . Let D ∞ i = ∩ ∞ n =1 S n i . We refer to the set D ∞ i as the set of strategies of player i that survive iterated strict dominance. We next define the process of iterative elimination of neverbest response strategies. Re call our notation that Δ( A ) denotes the set of probability measures over the set A [implying that the set Δ( S i ) denotes the set of all probability measures over the set S i , including independent mixings]....
View
Full
Document
This note was uploaded on 05/08/2010 for the course CS 6.254 taught by Professor Asuozdaglar during the Spring '10 term at MIT.
 Spring '10
 AsuOzdaglar

Click to edit the document details