作者kotin (赶快走?啦)
看板Economics
标题[请益] 赛局问题
时间Wed Nov 26 01:48:30 2008
: Find all the Nash equilibriums of the following game.
: Player 1 plays actions A B C with the left-side payoffs; on the
: other hand, player 2 chooses strategies L M R with the right-side
: payoffs. L M R
: A 0,1 0,0 10,0
: B 2,1 1,2 0,1
: C 1,2 2,1 0,1
做法好像是:
player1先消除A 然後player消除R
q 1-q
L M
p B 2,1 1,2
: 1-p C 1,2 2,1
然後再继续做
请问一下为什麽可以先消除
是怎麽看的
谢谢^^
--
※ 发信站: 批踢踢实业坊(ptt.cc)
◆ From: 60.251.138.237
1F：推 daniel955377:不管player1怎麽选, player2都不会选 220.136.50.227 11/26 01:52
2F：→ daniel955377:R, player1知道player2不会选R 220.136.50.227 11/26 01:52
3F：→ daniel955377:所以player1不会选A 220.136.50.227 11/26 01:53