国外博弈论课件lecture10.pptVIP

下载本文档

2
0
约1.37万字
约 30页
2017-12-19 发布于浙江
举报
版权申诉

国外博弈论课件lecture10.ppt

1、本文档共30页，可阅读全部内容。
2、有哪些信誉好的足球投注网站（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

国外博弈论课件lecture10

June 2, 2003 73-347 Game Theory--Lecture 10 June 2, 2003 Lecture 10 Static (or Simultaneous-Move) Games of Complete Information Mixed Strategy Nash Equilibrium Outline of Static Games of Complete Information Introduction to games Normal-form (or strategic-form) representation Iterated elimination of strictly dominated strategies Nash equilibrium Review of concave functions, optimization Applications of Nash equilibrium Mixed strategy Nash equilibrium Today’s Agenda Review of previous class Example: Rock, paper and scissors (Exercise 139.1 of Osborne) How to find mixed strategy Nash equilibria in a 2-player game each with a finite number of strategies Example: Rock, paper and scissors Each of two players simultaneously announces either Rock, or Paper, or Scissors. Paper beats (wraps) rock Rock beats (blunts) scissors Scissors beats (cuts) paper The player who names the winning object receives $1 from her opponent If both players name the same choice then no payment is made Example: Rock, paper and scissors Can you guess a mixed strategy Nash equilibrium? Mixed strategy Nash equilibrium: 2-player each with two pure strategies Mixed strategy Nash equilibrium: A pair of mixed strategies ((r*, 1-r*), (q*, 1-q*))is a Nash equilibrium if (r*,1-r*) is a best response to (q*, 1-q*), and (q*, 1-q*) is a best response to (r*,1-r*). That is,v1((r*, 1-r*), (q*, 1-q*)) ? v1((r, 1-r), (q*, 1-q*)), for all 0? r ?1v2((r*, 1-r*), (q*, 1-q*)) ? v2((r*, 1-r*), (q, 1-q)), for all 0? q ?1 2-player each with two strategies Theorem 1 (property of mixed Nash equilibrium) A pair of mixed strategies ((r*, 1-r*), (q*, 1-q*)) is a Nash equilibrium if and only if v1((r*, 1-r*), (q*, 1-q*)) ? EU1(s11, (q*, 1-q*))v1((r*, 1-r*), (q*, 1-q*)) ? EU1(s12, (q*, 1-q*)) v2((r*, 1-r*), (q*, 1-q*)) ? EU2(s21, (r*, 1-r*))v2((r*, 1-r*), (q*, 1-q*)) ? EU2(s22, (r*, 1-r*)) Mixed strategy equilibrium: 2-player each with two strategies Theorem 2 Let ((r*, 1-r*), (q*