第五讲 完美信息动态博弈.ppt

  1. 1、本文档共29页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
第五讲 Extensive games with perfect information 一、An example:entry game Challenger Out 1,2 In Incumbent Acquiesce Fight 2,1 0,0 The key features of a dynamic game of perfect information are that :(a) the moves occur in sequence, (b) all previous moves are observed before the next move is chosen, and (c) the players’ payoffs form each feasible combination of moves are common knowledge. 二、Strategies 在静态博弈中,博弈方一次性同时选择的行为就是博弈方的策略,这些策略的策略组合,以及所对应的各方得益,就是博弈的结果。 动态博弈方决策,不是博弈方在单个阶段的行为,而是各博弈方在整个博弈中轮到选择的每个阶段,针对前面阶段的各种情况作相应选择和行为的完整计划,以及由不同博弈方的这种计划构成的组合。动态博弈的结果包括双方(或多方)采用的策略组合,实现的博弈路径和各博弈方的得益。 二(1)Example 1 In entry game, the strategies is: Challenger:in,out Incumbent:acquiesce,fight 二(2)Example 2 1 D C 2 E F 2,1 3,0 0,2 1,3 G H 2 二(2)Example 2 Play 1 has two strategies:C and D; Play 2 has four strategies:EG,EH,FG,FH; And the outcome of the strategy pair (C,EG) and (C,EH) is (C,E),……. Action assigned to history C Action assigned to history D Strategy 1 E G Strategy 2 E H Strategy 3 F G Strategy 4 F H 二(3) Example 3 1 D C 2 2,0 E F 3,1 1 0,0 1,2 G H 二(3) Example 3 Player 1 has four strategies:CG,CH,DG and DH (In particular, each strategy specifies an action after the history (C,E) even if it specifies the action D at the beginning of the game, in which case the history (C,E) does not occur!) Player 2 has two strategies:E and F. The outcome of the strategy pair (DG,E) is the terminal history D, and the outcome of (CH,E) is the terminal history (C,E,H). 三、Nash equilibrium Definition (Nash equilibrium of extensive game with perfect information) The strategy profile s* in an extensive game with perfect information is a Nash equilibrium if,for every player i and every strategy ri of player i,the terminal history O(s*) generated by s* is as least as good according to player i’s preferences as the terminal history O(ri, s*-i) generated by the strategy profile (ri, s *-i) in which player i chooses ri while every other player j chooses s*j. Equivalently, for each player i,

文档评论(0)

企业资源 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档