博弈论 斯坦福game theory stanford week 3.2_

简介: title: 博弈论 斯坦福game theory stanford week 3-1tags: notenotebook: 6- 英文课程-15-game theory---博弈论 斯坦福game theory stanford week 3-1习题第 1 个问题We say t...

title: 博弈论 斯坦福game theory stanford week 3-1
tags: note
notebook: 6- 英文课程-15-game theory
---

博弈论 斯坦福game theory stanford week 3-1

习题

第 1 个问题

img_5d8fa8d4ec2efce7a8e96c6cf9172115.png

We say that a game is dominance solvable, if iterative deletion of strictly dominated strategies yields a unique outcome. True or false: The above game si dominance solvable. Hint: Consider both pure strategies and mixed strategies to do your domination.

a) True;

正确 
(a) is correct, the game is dominance solvable.

For player 2, R is dominated by a mixed strategy between L and M (for example, play L with probability 1/2 and M with probability 1/2).
Once R is removed, for player 1 D is dominated by U.
Finally, once R and D are removed, M is dominated by L.
Since the process of iterative deletion of strictly dominated strategies yields the unique outcome (U,L), the game is dominance solvable.

b) False.

第 2 个问题

正确
1 / 1 分
2。第 2 个问题
In order to illustrate the problem that arises when iteratively eliminating weakly dominated strategies, consider the following game:

img_5d8fa8d4ec2efce7a8e96c6cf9172115.png

True or false: in the above game the order of elimination of weakly dominated strategies does not matter (that is, the final outcome is the same regardless of the order in which weakly dominated strategies are eliminated.).

[Hint: start the process of iterative elimination of weakly dominated strategies by eliminating different strategies at the beginning of the process.]

a) True;

b) False.

正确 
(b) is correct, in the previous game the order of elimination of weakly dominated strategies does matter.

Consider the following attempts:
If we start by eliminating the weakly dominated strategy L:
For 2, L is weakly dominated by R.
Once L is removed, for 1 U is weakly dominated by D.
Once L and U are removed, M is strictly dominated by R.
The outcome of this process of elimination is (D,R).
If we start by eliminating the weakly dominated strategy M:
For 2, M is weakly dominated by R.
Once M is removed, for 1 D is weakly dominated by U.
Once M and D are removed, L is strictly dominated by R.
The outcome of this process of elimination is (U,R).
Then, the order of elimination of weakly dominated strategies does affect the outcome of the process.

第 3 个问题
正确
1 / 1 分

3。第 3 个问题

Consider the matching pennies game:

img_4e78d3e350ddef5e02491795ea90276d.png

Which is a maxmin strategy for player 1:

a) Play Left.

b) Play Right.

c) Play Left and Right with probability 1/2.

正确 
(c) is true.

Recall from lecture: S1=argmaxs′1∈S1mins2∈S2u1(s′1,s2)
Given a strategy of 1: play Left with probability p and Right with 1−p (0≤p≤1):
If p>1/2, s2=Right leads 1 to earn (−2)p+2(1−p)<0;
If p<1/2, s2=Left leads 1 to earn 2p+(−2)(1−p)<0;
If p=1/2, then regardless of 2's strategy 1 earns 0.
Thus p=1/2 is the maxmin strategy.

d) It doesn't exist.

第 4 个问题

正确
1 / 1 分
4。第 4 个问题
Consider the matching pennies game:

img_00652fdc20dadfec04a87a5e8b53cdc6.png

Apply the Minimax theorem presented in lecture 3-4 to find the payoff that any player must receive in any Nash Equilibrium:

a) 2;

b) -2;

c) 1;

d) 0.

正确 
(d) is true.

Since the previous game is a (finite) two-player, zero-sum game, by the theorem presented in the lecture we know that in any Nash equilibrium each player receives a payoff that is equal to both his maximin value and his minimax value.
From the previous question we know that each player's maximin strategy is to play Left and Right with probability 1/2, which gives an expected payoff (maximin value) of 0.

第 5 个问题

正确
1 / 1 分
5。第 5 个问题
img_e946047d6d0a6437faed171541e36809.png

Consider the following assignment device (for example a fair coin):

With probability 1/2 it tells players 1 and 2 to play B, and with probability 1/2 it tells them to play F.
Both players know that the device will follow this rule.
What is the expected payoff of each player when both players follow the recommendations made by the device? If one of players follows the recommendation, does the other player have an incentive to follow the recommendation as well?

a) Expected payoff =2; player has an incentive to follow the recommendation.

b) Expected payoff =1; player does not an incentive to follow the recommendation.

c) Expected payoff =1.5; player has an incentive to follow the recommendation.

正确 
(c) is true.

If both players follow the recommendation of the device, they will play (B,B) with probability 1/2 and (F,F) with probability 1/2. Then, the expected payoff is 1/2∗2+1/2∗1=1.5.
It is easy to check that if one of the players is following the recommendation, then the other player has an incentive to do the same:
Suppose that player 1 follows the recommendation of the device.
When player 2 is told to play B, he/she knows that player 1 was also told to play B (and that is the strategy that he/she will play).
Player's 2 best response to player 1 playing B is to also play B.
The same holds when player 2 is told to play F. Therefore, player 2 will follow what the device tells him/her to do.

d) Expected payoff =1.5; player does not have an incentive to follow the recommendation.

相关文章
|
决策智能
博弈论 斯坦福game theory stanford week 1.2_
title: '博弈论 斯坦福game theory stanford week 1-3' tags: note notebook: '6- 英文课程-15-game theory' --- 博弈论 斯坦福game theory stanford week 1-3 最优反应和纳什均衡 最优反应 如果你知道大家的反应,那么你很容易选择自己额行为 也就是当你的反应比其他的反应得到的效果都好,那么该反应就是最优反应。
821 0
|
网络协议 决策智能
博弈论 斯坦福game theory stanford week 1.0
game thory week1 引入:TCP链接 网络通过一个一个中继的链接传递信息 但是有些时候,信息的传输会发生溢出 如果其中的一个节点发生了故障 你的计算机会进行如下的两种反应:1. 重发当前的信息,2.减慢自己的发送速度,从而使故障点进行恢复 当出现这样的提示时,你应该使用正确的降速的TCP还是要使用原来的全速的tcp协议呢。
734 0
|
决策智能
博弈论 斯坦福game theory stanford week 4.1_
title: 博弈论 斯坦福game theory stanford week 4-1 tags: note notebook: 6- 英文课程-15-game theory --- 博弈论 斯坦福game theory stanford week 4-1 最后通牒式议价 他的形式是这样的,一个博弈者向另外一个博弈者提供一个价格,另一个决策者选择是否接受,如果不接受那么两个人将会什么都得不到。
1124 0
|
决策智能
博弈论 斯坦福game theory stanford week 7.1
title: 博弈论 斯坦福game theory stanford week 7-0 tags: note notebook: 6- 英文课程-15-game theory --- 博弈论 斯坦福game theory stanford week 7-0 coalitional game theory taste 联盟博弈论 我们在联盟博弈论中讨论的并不是一个个人的博弈了 而变成了一个联盟的博弈。
1020 0
|
决策智能
博弈论 斯坦福game theory stanford week 6.0_
title: 博弈论 斯坦福game theory stanford week 6-0 tags: note notebook: 6- 英文课程-15-game theory --- 博弈论 斯坦福game theory stanford week 6-0 Bayesian Games: Tast...
1031 0
|
决策智能
博弈论 斯坦福game theory stanford week 5.1_
title: 博弈论 斯坦福game theory stanford week 5-1 tags: note notebook: 6- 英文课程-15-game theory --- 博弈论 斯坦福game theory stanford week 5-1 练习 1.
1047 0
|
决策智能
博弈论 斯坦福game theory stanford week 3.1_
title: 博弈论 斯坦福game theory stanford week 3-1 tags: note notebook: 6- 英文课程-15-game theory --- 博弈论 斯坦福game theory stanford week 3-1 最大最小策略 这是一种相对比较保守的策略:最大最小值策略是某个决策者选择策略中让其最小收益最大化的策略,最大最小值是他选择这个策略的最小收益 用如下定义表示: 我们为什么要使用这种策略呢? 正是因为要达到优势策略均衡或纳什均衡是需要绝对理性的。
1111 0
|
决策智能
博弈论 斯坦福game theory stanford week 1.3_
title: '博弈论 斯坦福game theory stanford week 1-4' tags: note notebook: '6- 英文课程-15-game theory' --- 博弈论 斯坦福game theory stanford week 1-4 测试 1。
800 0
|
机器学习/深度学习 BI 决策智能
博弈论 斯坦福game theory stanford week 7.1_
title: 博弈论 斯坦福game theory stanford week 7-1 tags: note notebook: 6- 英文课程-15-game theory --- 博弈论 斯坦福game theory stanford week 7-1 1。
1332 0
|
决策智能
博弈论 斯坦福game theory stanford week 4.2_
title: 博弈论 斯坦福game theory stanford week 4-3 tags: note notebook: 6- 英文课程-15-game theory --- 博弈论 斯坦福game theory stanford week 4-2 练习 Correct 1 / 1 poi...
1096 0

热门文章

最新文章