摘要：无论是古代，还是现代。我们的学习与生活中，都会出现很多具有竞争性质的事件。比如：古代的“田忌赛马”，田忌与齐威王之间关于赛马的竞争；又比如：现代我们儿时常玩的游戏“锤子，剪刀，帕子”，两人之间的博弈。当然不只限于两人之间的竞争，也有一些多方竞争。每一方竞争者，为了自己取得最大的收益，都会思考其他人可能选择的方案并考虑最有利自己的方案。这种竞争的问题被我们称为对策论问题。 本文主要讨论了完全信息静态对策与完全信息动态对策问题。对于完全信息静态对策问题分为四种，分别为混合策略对策、纯策略对策、纯策略和混合策略多重均衡对策与古诺寡头对策。讲述了定义与具体案例的解法。对于完全信息动态对策问题讲述了基本的动态对策、重复对策与斯塔尔伯格寡头对策的定义与具体的案例解法。71006
毕业论文关键词：对策问题；最有利；解法；应用
ABSTRACT：Whether it is ancient or modern, in our study and life,there will be a lot of contest nature of the event.For example:the ancient “Tian Ji horse”,horse racing contest between Tian Ji and Qi Wei Wang ;another example:nowadays we often play the game “hammer,scissors,cloth”,the game between the two in our childhood.Of course not limited to the contest between the two,there are some multi-contest.Each side of the contest,in order to achieve their own maximum benefits,will consider which program other people may choose and consider the optimum program.This kind of contest problem is called the problem of game theory. This paper mianly discusses the static countermeasure with complete information and the dynamic one . The static countermeasure can be pided into four kinds, namely the mixed countermeasure , the pure countermeasure ,the multiple equilibrium countermeasures with both pure and mixed ,the Cournot oligarchy countermeasures. The definition and the specific case of the solution are also mentioned . As for the dynamic countermeasure , the basic dynamic countermeasure , the repeated countermeasure ,the definition of Stalberg oligarchy and the solution of its concrete cases are described.
Key words: Game problem； Most reasonable； solving process； application
目录
摘要 1
ABSTRACT 1
第一章 绪论 2
1.1 课题的目的及意义 2
1.3 基本概念及符号说明 2
1.3.1 基本概念 2
1.3.2 符号说明 3
第二章 完全信息静态对策 3
2.1 完全信息静态对策定义 3
2.2 混合策略对策 3
2.2.1混合策略的数学定义 3
2.2.2混合策略案例 4
2.3 纯策略对策 9
2.3.1纯策略对策的数学定义 9
2.3.2“画横线法” 9
2.3.3重复剔除严格劣方案 10
2.3.4箭头法 11
2.4古诺寡头对策 12
2.5纯策略和混合策略多重均衡对策 14
第三章 完全信息动态对策 16 对策论问题的几种解法及其应用:http://www.youerw.com/shuxue/lunwen_80533.html