凯恩斯选美图论模型其进化算法.docVIP

  • 6
  • 0
  • 约1.33万字
  • 约 8页
  • 2016-02-26 发布于安徽
  • 举报
--(完美WORD文档DOC格式,可在线免费浏览全文和下载)值得下载!

凯恩斯选美的图论模型及其进化算法 华侨大学数量经济研究院 李拉亚 本文中,我们用图论方法分析。我们发现可问题步图上 我们还提出 关键词:凯恩斯选美,算法,最长路径,Hamiltonian圈 The graph model of Keynesian beauty contest and its evolutionary algorithm Abstract In this paper, we use graph theory to analyze Keynesian beauty contest. We find that Keynesian beauty contest is equal to find the longest path in a graph. We also present an evolutionary algorithm that can find all longest paths in a graph synchronously. We present a new necessary condition for Hamiltonian cycles. Based on this new necessary condition, we can explain the complicated behavior of Keyne

文档评论(0)

1亿VIP精品文档

相关文档