西安电子科技大学:《博弈论》课程教学资源(PPT课件)Lecture 2 Mixed strategy game(任课教师:栾浩)

Matching pennies Player 2 Head Tail Head -1,1 1,-1 Player 1 Tail 1,-1 -1,1 Head is Player 1's best response to Player 2's strategy Tail Tail is Player 2's best response to Player 1's strategy Tail Tail is Player 1's best response to Player 2's strategy Head Head is Player 2's best response to Player 1's strategy Head Hence,NO Nash equilibrium 2
Matching pennies -1 , 1 1 , -1 1 , -1 -1 , 1 2 ◼ Head is Player 1’s best response to Player 2’s strategy Tail ◼ Tail is Player 2’s best response to Player 1’s strategy Tail ◼ Tail is Player 1’s best response to Player 2’s strategy Head ◼ Head is Player 2’s best response to Player 1’s strategy Head ➢ Hence, NO Nash equilibrium Player 1 Player 2 Tail Head Tail Head

Solving matching pennies Player 2 Head Tail Head -1,1 1,-1 Player 1 Tail 1,-1 -1 ,1 1- 9 1-q ■ Randomize your strategies Player 1 chooses Head and Tail with probabilities r and 1-r,respectively. Player 2 chooses Head and Tail with probabilities g and 1-g, respectively. ■ Mixed Strategy: Specifies that an actual move be chosen randomly from the set of pure strategies with some specific probabilities. 3
Solving matching pennies Player 2 Head Tail Player 1 Head -1 , 1 1 , -1 Tail 1 , -1 -1 , 1 3 ◼ Randomize your strategies ➢ Player 1 chooses Head and Tail with probabilities r and 1-r, respectively. ➢ Player 2 chooses Head and Tail with probabilities q and 1-q, respectively. ◼ Mixed Strategy: ➢ Specifies that an actual move be chosen randomly from the set of pure strategies with some specific probabilities. q 1-q r 1-r

Mixed strategy ■ A mixed strategy of a player is a probability distribution over player's(pure)strategies. >A mixed strategy for Chris is a probability distribution(p,1-p), where p is the probability of playing Opera,and 1-p is that probability of playing Prize Fight. If p=1 then Chris actually plays Opera.If p=0 then Chris actually plays Prize Fight. Battle of sexes Pat Opera Prize Fight Opera (p) 2, 0, 0 Chris Prize Fight(1-p) 0,( 0 2 1
Mixed strategy Battle of sexes Pat Opera Prize Fight Chris Opera (p) 2 , 1 0 , 0 Prize Fight (1-p) 0 , 0 1 , 2 4 ◼ A mixed strategy of a player is a probability distribution over player’s (pure) strategies. ➢ A mixed strategy for Chris is a probability distribution (p, 1-p), where p is the probability of playing Opera, and 1-p is that probability of playing Prize Fight. ➢ If p=1 then Chris actually plays Opera. If p=0 then Chris actually plays Prize Fight

Solving matching pennies Player 2 Expected Head Tail payoffs Head -1 1 1,-1 r 1-2g Player 1 Tail 1,-1 -1, 1 1-r 2g-1 9 1-9 Player 1's expected payoffs If Player 1 chooses Head,-g+(1-g)=1-2g If Player 1 chooses Tail,g-(1-g)=2g-1
Solving matching pennies Player 2 Head Tail Player 1 Head -1 , 1 1 , -1 Tail 1 , -1 -1 , 1 5 ◼ Player 1’s expected payoffs ➢ If Player 1 chooses Head, -q+(1-q)=1-2q ➢ If Player 1 chooses Tail, q-(1-q)=2q-1 q 1-q 1-2q 2q-1 Expected payoffs r 1-r

Solving matching pennies Player 2 Expected Head Tail payoffs Head -1, 1 1,-1 r 1-2q Player 1 Tail 1,-1 -1,1 1-r 2g-1 q 1-q ↑ Player 1's best response B1(g): For q0.5,Tail (r=0) For q=0.5,indifferent (0sr<1) 1/2 6
Solving matching pennies Player 2 Head Tail Player 1 Head -1 , 1 1 , -1 Tail 1 , -1 -1 , 1 6 ◼ Player 1’s best response B1(q): ➢ For q0.5, Tail (r=0) ➢ For q=0.5, indifferent (0r1) 1 q r 1 1/2 1/2 q 1-q 1-2q 2q-1 Expected payoffs r 1-r

Solving matching pennies Player 2 Expected Head Tail payoffs Head -1,1 1,-1 r 1-2q Player 1 Tail 1,-1 -1,1 1-x 2g-1 Expected q 1-q payoffs 2r-1 1-2r Player 2's expected payoffs If Player 2 chooses Head,-(1-z)=2-1 If Player 2 chooses Tail,+(-z)=1-2
Solving matching pennies Player 2 Head Tail Player 1 Head -1 , 1 1 , -1 Tail 1 , -1 -1 , 1 7 ◼ Player 2’s expected payoffs ➢ If Player 2 chooses Head, r-(1-r)=2r-1 ➢ If Player 2 chooses Tail, -r+(1-r)=1-2r 1-2q 2q-1 Expected payoffs r 1-r Expected q 1-q payoffs 2r-1 1-2r

Solving matching pennies Player 2 Expected Head Tail payoffs Head -1, 1 1,-1 1-2g Player 1 Tail 1,-1 -1,1 1-x 2g-1 Expected q 1-q payoffs 2x-1 1-2x ↑ Player 2's best response B2(r): For r0.5,Head (q=1) For r=0.5,indifferent (0sq<1) 1/2
Solving matching pennies Player 2 Head Tail Player 1 Head -1 , 1 1 , -1 Tail 1 , -1 -1 , 1 8 ◼ Player 2’s best response B2(r): ➢ For r0.5, Head (q=1) ➢ For r=0.5, indifferent (0q1) q 1-q 1-2q 2q-1 Expected payoffs r 1-r Expected payoffs 2r-1 1-2r 1 q r 1 1/2 1/2

Solving matching pennies Player 2 Head Tail Player 1's best response B1(g): Player Head -1,1 1-1 For q0.5,Tail (r=0) For q=0.5,indifferent (0srs1) q 1-9 Player 2's best response Mixed strategy B2(r): Nash equilibrium For rFor r>0.5,Head (q=1) >For r=0.5,indifferent (0sqs1) √Check 12 x=0.5∈B1(0.5) q=0.5∈B2(0.5) 1/2 1 9
Solving matching pennies Player 2 Head Tail Player 1 Head -1 , 1 1 , -1 Tail 1 , -1 -1 , 1 9 ◼ Player 1’s best response B1(q): ➢ For q0.5, Tail (r=0) ➢ For q=0.5, indifferent (0r1) ◼ Player 2’s best response B2(r): ➢ For r0.5, Head (q=1) ➢ For r=0.5, indifferent (0q1) ✓ Check r = 0.5 B1(0.5) q = 0.5 B2(0.5) 1 q r 1 1/2 1/2 r 1-r q 1-q Mixed strategy Nash equilibrium

Mixed strategy:example Matching pennies Player 1 has two pure strategies:H and T (o(H)=0.5,1(T)=0.5)is a Mixed strategy. That is,player 1 plays H and T with probabilities 0.5 and 0.5,respectively. (1(H)=0.3,1(T)=0.7)is another Mixed strategy. That is,player 1 plays H and T with probabilities 0.3 and 0.7,respectively. 而
Mixed strategy: example ◼ Matching pennies ◼ Player 1 has two pure strategies: H and T ( 1 (H)=0.5, 1 (T)=0.5 ) is a Mixed strategy. That is, player 1 plays H and T with probabilities 0.5 and 0.5, respectively. ( 1 (H)=0.3, 1 (T)=0.7 ) is another Mixed strategy. That is, player 1 plays H and T with probabilities 0.3 and 0.7, respectively. 10

Mixed strategy:example Player 2 L(O) C(113) R(213) T(3/4) 0 2 3, 3 1, 1 Player 1 M(O) 4 0 0, ¥ 2, 3 B(1/4) 4 5, 1 01 7 Player 1: >(3/4,0,4)is a mixed strategy.That is, o1(T)=3/4,o1(M)=0ando1(B)=1/4. ■ Player 2: >(0,1/3,2/3)is a mixed strategy.That is, o2(L)=0,o2(C)=1/3ando2(R)=2/3. 1
Mixed strategy: example Player 2 L (0) C (1/3) R (2/3) Player 1 T (3/4) 0 , 2 3 , 3 1 , 1 M (0) 4 , 0 0 , 4 2 , 3 B (1/4) 3 , 4 5 , 1 0 , 7 11 ◼ Player 1: ➢ (3/4, 0, ¼) is a mixed strategy. That is, 1 (T)=3/4, 1 (M)=0 and 1 (B)=1/4. ◼ Player 2: ➢ (0, 1/3, 2/3) is a mixed strategy. That is, 2 (L)=0, 2 (C)=1/3 and 2 (R)=2/3
按次数下载不扣除下载券;
注册用户24小时内重复下载只扣除一次;
顺序:VIP每日次数-->可用次数-->下载券;
- 西安电子科技大学:《博弈论》课程教学资源(PPT课件)Lecture 1 GAME THEORY - Static complete information pure strategy game.ppt
- 《概率论与数理统计》课程教学资源(参考教材)概率论教材 Probability and Statistics《A FIRST COURSE IN PROBABILITY》英文电子版(Eighth Edition,Sheldon Ross).pdf
- 同济大学:《概率论与数理统计》课程教学资源(讲稿)Chapter 9 Sampling Distributions.pdf
- 同济大学:《概率论与数理统计》课程教学资源(讲稿)Chapter 10 Point Estimation.pdf
- 同济大学:《概率论与数理统计》课程教学资源(讲稿)Chapter 8 Limit Theorems.pdf
- 同济大学:《概率论与数理统计》课程教学资源(讲稿)Chapter 6 Jointly Distributed Random Variables.pdf
- 同济大学:《概率论与数理统计》课程教学资源(讲稿)Chapter 5 Continuous Random Variables.pdf
- 同济大学:《概率论与数理统计》课程教学资源(讲稿)Chapter 4 Mathematics.pdf
- 同济大学:《概率论与数理统计》课程教学资源(讲稿)Chapter 3 Conditional Probability and Independence.pdf
- 同济大学:《概率论与数理统计》课程教学资源(讲稿)Chapter 2 Axioms of Probability(负责人:花虹).pdf
- 同济大学:《复变函数和积分变换》课程教学资源(PPT课件讲稿)习题选讲4(积分的计算、共形映照).pptx
- 同济大学:《复变函数和积分变换》课程教学资源(PPT课件讲稿)习题选讲3(级数及其应用、奇点与留数).pptx
- 同济大学:《复变函数和积分变换》课程教学资源(PPT课件讲稿)习题选讲2(复变函数的两种形式、计算解析函数的级数).pptx
- 同济大学:《复变函数和积分变换》课程教学资源(PPT课件讲稿)习题选讲1(复数的四则运算、复数的幂与根).pptx
- 同济大学:《复变函数和积分变换》课程教学资源(PPT课件讲稿)5-2-分式线性变换.pptx
- 同济大学:《复变函数和积分变换》课程教学资源(PPT课件讲稿)5-1-映射的共形性.pptx
- 同济大学:《复变函数和积分变换》课程教学资源(PPT课件讲稿)4-3-利用积分变换求解微分方程.pptx
- 同济大学:《复变函数和积分变换》课程教学资源(PPT课件讲稿)4-2-Laplace变换.pptx
- 同济大学:《复变函数和积分变换》课程教学资源(PPT课件讲稿)4-1-Fourier变换.pptx
- 同济大学:《复变函数和积分变换》课程教学资源(PPT课件讲稿)3-6-利用留数定理计算广义积分.pptx
- 西安电子科技大学:《博弈论》课程教学资源(PPT课件)Lecture 3 Dynamic games of complete information.ppt
- 西安电子科技大学:《博弈论》课程教学资源(PPT课件)Lecture 4 Static game of incomplete information.ppt
- 西安电子科技大学:《博弈论》课程教学资源(PPT课件)Lecture 5 Dynamic game with Incomplete Information.ppt
- 同济大学:《常微分方程》课程教学资源(讲义)First-order differential equations.pdf
- 同济大学:《常微分方程》课程教学资源(讲义)微分方程基本概念及几类可求解析解的方程.pdf
- 同济大学:《常微分方程》课程教学资源(讲义)高阶线性微分方程.pdf
- 同济大学:《常微分方程》课程教学资源(讲义)线性微分方程组 Linear Systems of Differential Equations(负责人:尚培培).pdf
- 同济大学:《常微分方程》课程教学资源(讲义)非线性微分方程及现象 Nonlinear Systems and Phenomena.pdf
- 同济大学:《运筹学》课程教学资源(试卷习题)运筹学试卷1.doc
- 同济大学:《运筹学》课程教学资源(试卷习题)运筹学试卷2.doc
- 同济大学:《运筹学》课程教学资源(课件讲稿)引言 Operations Research(负责人:陈雄达).pdf
- 同济大学:《运筹学》课程教学资源(PPT课件讲稿)线性规划基本性质.ppt
- 同济大学:《运筹学》课程教学资源(PPT课件讲稿)一维搜索.ppt
- 同济大学:《运筹学》课程教学资源(PPT课件讲稿)单纯形方法.ppt
- 同济大学:《运筹学》课程教学资源(PPT课件讲稿)对偶理论及灵敏度分析.ppt
- 同济大学:《运筹学》课程教学资源(PPT课件讲稿)整数(线性)规划.ppt
- 同济大学:《运筹学》课程教学资源(PPT课件讲稿)使用导数的最优化方法(无约束优化方法).ppt
- 同济大学:《运筹学》课程教学资源(PPT课件讲稿)最优性条件.ppt
- 同济大学:《运筹学》课程教学资源(PPT课件讲稿)惩罚函数法.ppt
- 《线性代数》课程教学资源(文献资料)THE $25,000,000,000 EIGENVECTOR THE LINEAR ALGEBRA BEHIND GOOGLE.pdf