14 views

Uploaded by endu wesen

Microeconomics

save

You are on page 1of 17

Domination with Mixed Strategies

Characterization of Mixed Strategies

.

**Introduction to Game Theory
**

.

**Lecture Note 3: Mixed Strategies
**

HUANG Haifeng University of California, Merced

in which players can randomize over their actions. in which players choose deterministic actions.. i. the vNM preferences (冯诺依曼—摩根 斯坦偏好)–preferences regarding lotteries over action proﬁles that may be represented by the expected value of a payoﬀ function over action proﬁles.e.vNM Expected Utilities and Mixed Strategies Domination with Mixed Strategies Characterization of Mixed Strategies Mixed strategies and von Neumann-Morgenstern preferences • So far what we have considered are pure strategy equilibria (纯粹策略). • This means we need to deal with preferences regarding lotteries (彩票). • Now we consider mixed strategy equilibria (混合策略). .

and you can take expectations over the numbers. not just the order.vNM Expected Utilities and Mixed Strategies Domination with Mixed Strategies Characterization of Mixed Strategies Mixed strategies and von Neumann-Morgenstern preferences • In pure strategy equilibria. not how much you prefer one item over another. the payoﬀ numbers in a game state the intensity of your preferences. • With vNM preferences. we deal with ordinal preferences (序数性偏好). which only specify the order of your preferences. .

. . pK ) only if ∑K k=1 pk u(ak ) > ∑K ′ k=1 pk u(ak ). and pk is the probability that ak will ′ • You prefer the lottery (p1 . • With vNM preferences.. pK ) to the lottery (p′ 1 .. where ak is the kth outcome of the lottery... . pK ) = happen.vNM Expected Utilities and Mixed Strategies Domination with Mixed Strategies Characterization of Mixed Strategies von Neumann-Morgenstern Expected Utilities • The following tables represent the same game with ordinal preferences but diﬀerent games with vNM preferences.. we can derive expected utilities over lotteries: U(p1 . .. ∑K k=1 pk u(ak )....

vNM Expected Utilities and Mixed Strategies Domination with Mixed Strategies Characterization of Mixed Strategies Mixed strategy Nash equilibrium • A mixed strategy of a player in a strategic game is a probability distribution over the player’s actions. α− i ) ≥ Ui (αi . • Using best response functions. α−i ). α∗ is a mixed strategy NE iﬀ αi∗ is in Bi (αi∗ ) for every player i. e. αi (left) = 1 3 .g. • The mixed strategy proﬁle α∗ in a strategic game is a mixed strategy Nash equilibrium if ∗ ∗ Ui (αi∗ . ∀αi and i. where Ui (α) is player i’s expected payoﬀ with the mixed strategy proﬁle α. .. denoted by 2 αi (ai ). ◃ A pure strategy is a mixed strategy that assigns probability 1 to a particular action. αi (right) = 3 .

• Theorem (Nash 1950): Every ﬁnite strategic game with vNM preferences has a mixed strategy Nash equilibrium. tail. 2 . 1 2 . −1 • But there is a mixed strategy NE for the game with the above 1 1 1 vNM preferences: ((head. 1 1.vNM Expected Utilities and Mixed Strategies Domination with Mixed Strategies Characterization of Mixed Strategies Matching Pennies reconsidered • There is no pure strategy Nash equilibrium in Matching Pennies. Player 2 head Player 1 head tail 1. tail. . 2 ). −1 −1. 1 tail −1. (head. 2 )).

B. 1 − p). player 1 has no action that is dominated by a pure strategy. p. B 0. a−i ) for every list a−i of the other players’ actions. f • A strictly dominated action is not used in any mixed strategy Nash equilibrium. But action T is dominated by the mixed strategy (M. d 1 4 <p< 2 3. with Player 2 L Player 1 T M 1. e 3. b 0. • In the following game. . a−i ) > ui (a′ i .vNM Expected Utilities and Mixed Strategies Domination with Mixed Strategies Characterization of Mixed Strategies Strict domination with mixed strategies • Player i’s mixed strategy αi strictly dominates her action a′ i if Ui (αi . a 4. a′ i is strictly dominated. c R 1.

. a−i ) ≥ ui (a′ i . may be used in a mixed strategy NE. • A weakly dominated action. and Ui (αi . a−i ) for every list a−i of the other players’ actions. however. • But every ﬁnite strategic game has a mixed strategy NE in which no player’s strategy is weakly dominated.vNM Expected Utilities and Mixed Strategies Domination with Mixed Strategies Characterization of Mixed Strategies Weak domination with mixed strategies • Player i’s mixed strategy αi weakly dominates action a′ i if Ui (αi . a−i ) for some list a−i of the other players’ actions. a−i ) > ui (a′ i .

for each player i. given α− i i assigns positive probability is the same (⇒ otherwise i should just play the more proﬁtable action rather than mixing it with other actions). 1 . given α− i i assigns zero probability is lower or at most equal to the expected payoﬀ to any action to which α∗ assigns positive probability (⇒ otherwise i should play that action). ∗ .vNM Expected Utilities and Mixed Strategies Domination with Mixed Strategies Characterization of Mixed Strategies Characterization of mixed strategy NE in ﬁnite games A characterization for ﬁnite strategic games: a mixed strategy proﬁle α∗ is a mixed strategy NE iﬀ. to every action to which α∗ the expected payoﬀ. other players’ equilibrium mixed strategies keep you indiﬀerent between a set of your actions. 2 . . ◃ In other words. to every action to which α∗ the expected payoﬀ. ∗ .

choose a subset Si of her set Ai of actions Check if there is a mixed strategy proﬁle α that (1) assigns positive probability only to actions in Si . . and (2) satisﬁes the two conditions in the previous characterization Repeat the analysis for every other collection of subsets of the players’ sets of actions 4 . 2 . Eliminate strictly dominated actions from the game For each player i.vNM Expected Utilities and Mixed Strategies Domination with Mixed Strategies Characterization of Mixed Strategies Method for ﬁnding all mixed strategy NE 1 . 3 .

B) and (S.vNM Expected Utilities and Mixed Strategies Domination with Mixed Strategies Characterization of Mixed Strategies Example • Consider the variant of the Battle of Sexes game below. we see there is no dominated strategy to be eliminated. 0 S 0. (B. . 3 • By inspection. What are the mixed strategy NE? Player 2 B Player 1 B S 4. 0 2. 1 1. 2 0. S) are two pure strategy equilibria. Further. 4 X 0.

• Similar reasoning rules out the potential equilibrium in which player 2 plays pure strategy while player 1 randomize over her two actions. while player 2 mixes over two of her three actions: B &S.vNM Expected Utilities and Mixed Strategies Domination with Mixed Strategies Characterization of Mixed Strategies Four possible kinds of mixed strategy equilibrium • What about an equilibrium in which player 1 plays a pure strategy (B or S). B &X. • What about an equilibrium in which player 1 mixes over her two actions. while player 2 plays a strictly mixed strategy? Condition 1 of the characterization impossible to meet. or S&X? • What about an equilibrium in which player 1 mixes over her two actions. and player 2 mixes over her three actions? .

vNM Expected Utilities and Mixed Strategies Domination with Mixed Strategies Characterization of Mixed Strategies Analyzing the example (1) • Let player 1’s probability of playing B be p (hence 1 − p for S). 5 . (B. 4q + 0 = 0 + (1 − q) ⇒ q = 1 5. ◃ Next we should examine player 2’s randomization. X. . Let q be her probability of choosing B (hence 1 − q for X). For player 1 to be indiﬀerent between her two actions (condition 1. condition 2 moot here). 4 ). S. 3 4 . Impossible to hold. 1 1 4 ◃ Thus ((B. 0. S. • Player 2 mixes over B and S: ◃ To satisfy conditions 1 and 2 we need 2p = 4(1 − p) ≥ p + 3(1 − p). • Player 2 mixes over B and X: ◃ To satisfy the two conditions we need 3 2p = p + 3(1 − p) ≥ 4(1 − p) ⇒ p = 4 . 5 )) is a mixed strategy NE.

0.vNM Expected Utilities and Mixed Strategies Domination with Mixed Strategies Characterization of Mixed Strategies Analyzing the example (2) • Player 2 mixes over S and X: ◃ In this case player 1 will always choose S. . S. condition 2 moot here)). 5 ) . • Player 2 mixes over B. 3 4 . and X ◃ For player 2 to be indiﬀerent between her three actions (condition 1. we need 2p = 4(1 − p) = p + 3(1 − p) ⇒ impossible. (B. • The NE are the two pure strategy equilibria and the strictly ( ) 1 1 4 mixed strategy NE (B. 5 . 4 ). S. X. S. So no NE in which player 1 mixes over B and S.

and player 3 chooses between tables. .vNM Expected Utilities and Mixed Strategies Domination with Mixed Strategies Characterization of Mixed Strategies A three-player example • Player 1 chooses between rows. player 2 chooses between columns.

• The only remaining case is all three mix over A and B. Let p. 3 . q. A. • If one of the players’ strategy is pure. and r respectively denote the three players’ probability of choosing A. pq = 4(1 − p)(1 − q). qr = 4(1 − q)(1 − r).vNM Expected Utilities and Mixed Strategies Domination with Mixed Strategies Characterization of Mixed Strategies Analyzing the three-player example • By inspection (A. 2 3 • Therefore p = q = r = is a mixed strategy NE. obviously the other two should choose the ﬁrst player’s action rather than mix over two or more actions. B. A) and (B. . pr = 4(1 − p)(1 − r). Then condition 1 of the characterization requires 1 . B) are two pure-strategy NE. 2 .

• Condition 1 of the characterization in ﬁnite games does not apply in inﬁnite games because the probabilities are now assigned to sets of actions. .vNM Expected Utilities and Mixed Strategies Domination with Mixed Strategies Characterization of Mixed Strategies Characterization of mixed strategy NE in inﬁnite games • Finite games must have a mixed strategy NE. • A characterization for inﬁnite strategic games: a mixed strategy proﬁle α∗ is a mixed strategy NE iﬀ. α− i ) yield player i an expected payoﬀ greater than her expected payoﬀ to α∗ . ◃ α∗ assigns probability zero to the set of actions ai for which ∗ the action proﬁle (ai . Inﬁnite games may or may not have one. not single actions. α− i ) yields player i an expected payoﬀ less than her expected payoﬀ from α∗ . for each player i. ∗ ◃ for no action ai does the action proﬁle (ai .

- Secure or Insure? A Game-Theoretic Analysis of Information Security GamesUploaded bymachinelearner
- Game Theory + StrategyUploaded byDanilo GArzofino
- Game TheoryUploaded byThach Linh Truong
- Application of Game TheoryUploaded bymithunsraj@gmail.com
- Homework 1 ECON 351Uploaded byBilly Rivers
- (4)Coalition-Proof Nash Equilibria and Cores in a Strategic Pure Exchange Game of BadsUploaded byEnnayojarav
- ChiapporiGrosecloseLevitt2002Uploaded byMuhammad Haziq Mohd Nor
- Ozdaglar-NecSys2012.pdfUploaded bydiaozizidiao
- NashUploaded byValentin Matei
- Module 5_Problem Sets-2 (1)Uploaded byEli Koech
- GT08 Dynamic Problems.pdfUploaded byĐỗ Huy Hoàng
- PROBABILITY OF A PURE EQUILIBRIUM POINTUploaded byJuan O Antezana B
- ECON2001_tutorial 4_2017 (1)Uploaded bySta Ker
- Dynamic CompetitionUploaded byTimothy Rios
- Lies International CoooperationUploaded byJuan Pablo
- Game TheoryUploaded bySuman Singh
- The Basics of Game Theory And Associated GamesUploaded byNick Johnson
- Harsanyi - Nobel Lecture Games With Incomplete InformationUploaded byAlexandru Volacu
- Games_IOUploaded byRussell Kueh
- MGEH14-PS4Uploaded byHaley Hopper
- Games and Economic Behavior Volume 14 issue 2 1996 [doi 10.1006%2Fgame.1996.0053] Roger B. Myerson -- John Nash's Contribution to Economics.pdfUploaded byEugenio Martinez
- Game Theory Solution Concepts DiscussionUploaded byMiguel Córdoba
- Note for a Course in GTUploaded bysidhaha
- TN20_4eUploaded bypolerdio
- SequentialUploaded bythiagopoleto
- Basic Theory, Normal Form Games and Iterated dominance.pdfUploaded byAntónio Fonseca
- Game TheoryUploaded byRohan Kelkar
- Advanced Economicsciences2005Uploaded bysamuelbrb
- Game TheoryUploaded byfjaltimirasg
- A NOVEL CHARGING AND ACCOUNTING SCHEME IN MOBILE AD-HOC NETWORKSUploaded byAIRCC - IJNSA

- Game theoryUploaded byendu wesen
- Combinatorial OptimizationUploaded byendu wesen
- Evolutionary Stability in Pure Strategy_yale_handoutUploaded byendu wesen
- Mixed Strategies Handout Yale CourseUploaded byendu wesen
- Mixed Integer Prog_excel Solver Practice ExampleUploaded byendu wesen
- Game Theory Exercises 2Uploaded byendu wesen
- Two Sided MarketsUploaded byendu wesen
- LectureNotes EconomicsUploaded byendu wesen
- Polynomial Time ReductionUploaded byendu wesen
- Industrial Eco Lecture NoteUploaded byendu wesen
- Durablegoods MonopolyUploaded byendu wesen
- Static Games of Complete InformationUploaded byendu wesen
- Game Theory Exercises 3Uploaded byendu wesen
- Mixed Integer Prog_excel Solver Practice Example BESTUploaded byendu wesen
- Game Theory Exercise and SolutionUploaded byendu wesen
- Linear ProgeammingUploaded byendu wesen
- decoupling empty voting.pdfUploaded byendu wesen
- 08 - Project Monitoring and ControlUploaded byendu wesen
- static games of complete information (1).pdfUploaded byendu wesen
- LectureNotes EconomicsUploaded byendu wesen
- derivatives.pdfUploaded byendu wesen
- 1. monopoly market power and market failures.pdfUploaded byendu wesen
- decision making under uncertainity.pdfUploaded byendu wesen
- 2. externalities and public goods.pdfUploaded byendu wesen
- SQC Final Exam June 2010Uploaded byendu wesen
- Probability and Statistics NotesUploaded byendu wesen
- Tracing FrontierUploaded byendu wesen
- Acceptance SamplingUploaded byendu wesen
- SQC testUploaded byendu wesen