lecture13Dynamic Games of Complete and Perfect Information(博弈论,Carnegie Mellon University).pptVIP
- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
lecture13Dynamic Games of Complete and Perfect Information(博弈论,Carnegie Mellon University)
June 5, 2003 73-347 Game Theory--Lecture 13 June 5, 2003 Lecture 13 Dynamic Games of Complete Information Dynamic Games of Complete and Perfect Information Outline of dynamic games of complete information Dynamic games of complete information Extensive-form representation Dynamic games of complete and perfect information Game tree Subgame-perfect Nash equilibrium Backward induction Applications Dynamic games of complete and imperfect information More applications Repeated games Today’s Agenda Review of previous class Subgame Subgame-perfect Nash equilibrium Backward induction Sequential bargaining (2.1.D of Gibbons) Dynamic (or sequential-move) games of complete information A set of players Who moves when and what action choices are available? What do players know when they move? Players’ payoffs are determined by their choices. All these are common knowledge among the players. Dynamic games of complete and perfect information Perfect information All previous moves are observed before the next move is chosen. A player knows Who has moved What before she makes a decision Entry game An incumbent monopolist faces the possibility of entry by a challenger. The challenger may choose to enter or stay out. If the challenger enters, the incumbent can choose either to accommodate or to fight. The payoffs are common knowledge. Strategy and payoff A strategy for a player is a complete plan of actions. It specifies a feasible action for the player in every contingency in which the player might be called on to act. It specifies what the player does at each of her nodes Nash equilibrium in a dynamic game We can also use normal-form to represent a dynamic game The set of Nash equilibria in a dynamic game of complete information is the set of Nash equilibria of its normal-form How to find the Nash equilibria in a dynamic game of complete information Construct the normal-form of the dynamic game of complete information Find the Nash equilibria in the normal-form Entry game Chall
您可能关注的文档
- lecture15Dynamic Games of Complete and Perfect Information(博弈论,Carnegie Mellon University).ppt
- lecture15The Capital Structure Decision(财务管理-台湾大学,廖咸与).ppt
- lecture16Dynamic Games of Complete and Imperfect Information(博弈论,Carnegie Mellon University).ppt
- lecture17Dynamic Games of Complete and Imperfect Information(博弈论,Carnegie Mellon University).ppt
- lecture18Dynamic Games of Complete and Imperfect Information(博弈论,Carnegie Mellon University).ppt
- Lecture1最优化.ppt
- lecture21-linkanalysis 信息检索导论 王斌 PPT 课件 第21章.pptx
- lecture21Dynamic Games of Complete and Imperfect Information(博弈论,Carnegie Mellon University).ppt
- lecture20-crawling 信息检索导论 王斌 PPT 课件 第20章.pptx
- Lecture3加词法.ppt
文档评论(0)