博弈论lecture4概要.ppt

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
* 博弈论 * Cournot model of oligopoly How to find a Nash equilibrium Find the quantities (q1*, ... qn*) such that qi* is firm i’s best response to other firms’ quantities That is, q1* solves Max u1(q1, q2*, ..., qn*)=q1(a-(q1+q2* +...+qn*)-c) subject to 0 ? q1 ? +∞ and q2* solves Max u2(q1*, q2 , q3*, ..., qn*)=q2(a-(q1*+q2+q3*+ ...+ qn*)-c) subject to 0 ? q2 ? +∞ ....... * 博弈论 * Summary Nash equilibrium Concave function and maximization Cournot model of duopoly and oligopoly Next time Bertrand model of Duopoly Reading lists Sec 1.2.B of Gibbons and Sec 3.1-3.2 of Osborne Lecture 4 May 22, 2003 * 博弈论 博弈论 * 博弈论 * Static (or Simultaneous-Move) Games of Complete Information Concave Function and Maximization Cournot models of duopoly and oligopoly * 博弈论 * 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 equilibrium * 博弈论 * Agenda Review of previous classes Concave functions Solving maximization problem Cournot models of duopoly and oligopoly * 博弈论 * Review: iterated elimination of strictly dominated strategies If a strategy is strictly dominated, eliminate it The size and complexity of the game is reduced Eliminate any strictly dominated strategies from the reduced game Continue doing so successively -1 , -1 -9 , 0 0 , -9 -6 , -6 Prisoner 1 Prisoner 2 Confess Mum Confess Mum * 博弈论 * Definition: Nash Equilibrium Given others’ choices, player i cannot be better-off if she deviates from si* Prisoner 2 Mum Confess Prisoner 1 Mum -1 , -1 -9 , 0 Confess 0 , -9 -6 , -6 * 博弈论 * Nash equilibrium survive iterated elimination of strictly dominated strategies 1 , 0 1 , 2 0 , 1 0 , 3 0 , 1 2 , 0 Player 1 Player 2 Middle Up Down Left 1 , 0 1 , 2 0 , 3 0 , 1 Player 1 Player 2 Middle Up Down Left Right * 博弈论 * The strategies

文档评论(0)

33894522 + 关注
实名认证
内容提供者

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

1亿VIP精品文档

相关文档