Graphical Models for Game Theory - University of Pennsylvania.ppt

Graphical Models for Game Theory - University of Pennsylvania.ppt

  1. 1、本文档共29页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Graphical Models for Game Theory - University of Pennsylvania.ppt

Network Models and Algorithms for Strategic and Economic Reasoning Michael Kearns Computer and Information Science University of Pennsylvania World Congress of the Game Theory Society Marseille, July 2004 International Trade Sources of Structured Interaction in Social and Economic Analysis Trade agreements and restrictions Social relationships between business people Reporting and organizational structure in a firm Regulatory restrictions on Wall Street Shared influences within an industry or sector Geographical dispersion of parties Physical connectivity (Internet, peer-to-peer) Computational benefits of modeling network structure? improved algorithms for equilibrium computation distributed, local computation and adaptation richer kinds of “conditional equilibrium” queries How does network topology influence outcomes? local interaction vs. global equilibrium coalitions, correlations and network structure price variation, wealth distribution and network structure What kinds of networks to examine? social network theory and generative models small worlds, preferential attachment and random graphs Outline Graphical Games and the NashProp Algorithm [K., Littman Singh 01]; [Ortiz K. 02] Correlated Equilibria, Graphical Games, and Markov Networks [Kakade, K. Langford 03] Graphical Economics and Social Network Theory [Kakade, K. Ortiz 04]; [Kakade, K., Ortiz, Pemantle, Suri 04] Graphical Games and NashProp Graphical Models for Game Theory Alternative to normal form, which grows exp(n) for n players Undirected graph G capturing local (strategic) interactions Each player represented by a vertex N_i(G) : neighbors of i in G (includes i) Assume: Payoffs expressible as M_i(a) where a over only N_i(G) Graphical game: (G,{M_i}) Compact representation of game Exponential in max degree ( # of players) Must still look for special structure for efficient computations Related models: [Koller Milch 01] [La Mura 00] The NashProp Algorithm Local message-passing; tables of

文档评论(0)

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

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

1亿VIP精品文档

相关文档