《RECENT ADVANCES IN GAME THEORY NEW EQUILIBRIUMS，POLYMATRIX AND BIMATRIX GAMES，AND COMPUTATIONAL METHODS（博弈论最新进展：新均衡、多矩阵博弈及计算方法）》的目的是在研究生层面提供博弈论的最新全面、严谨的结果。《RECENT ADVANCES IN GAME THEORY NEW EQUILIBRIUMS，POLYMATRIX AND BIMATRIX GAMES，AND COMPUTATIONAL METHODS（博弈论最新进展：新均衡、多矩阵博弈及计算方法）》旨在向读者介绍计算游戏均衡的优化方法和算法。作者假设读者熟悉博弈论、数学规划、优化和非凸优化的基本概念。我们打算《RECENT ADVANCES IN GAME THEORY NEW EQUILIBRIUMS，POLYMATRIX AND BIMATRIX GAMES，AND COMPUTATIONAL METHODS（博弈论最新进展：新均衡、多矩阵博弈及计算方法）》也用于研究生阶段工程、运筹学、计算机科学和数学系提供的优化、博弈论课程。由于《RECENT ADVANCES IN GAME THEORY NEW EQUILIBRIUMS，POLYMATRIX AND BIMATRIX GAMES，AND COMPUTATIONAL METHODS（博弈论最新进展：新均衡、多矩阵博弈及计算方法）》涉及了许多在早期优化教科《RECENT ADVANCES IN GAME THEORY NEW EQUILIBRIUMS，POLYMATRIX AND BIMATRIX GAMES，AND COMPUTATIONAL METHODS（博弈论最新进展：新均衡、多矩阵博弈及计算方法）》没有描述的计算平衡的新算法和想法，我们希望《RECENT ADVANCES IN GAME THEORY NEW EQUILIBRIUMS，POLYMATRIX AND BIMATRIX GAMES，AND COMPUTATIONAL METHODS（博弈论最新进展：新均衡、多矩阵博弈及计算方法）》不仅对博弈论专家有用，而且对优化研究人员也有用。除了纳什均衡、伯杰均衡、非合作博弈等**主题外，一些重要的*近的发展包括：最大*小和*小最大问题、反纳什、反伯杰均衡、多矩阵博弈、广义纳什均衡、计算方法和算法。
目錄：
Contents Preface Chapter1 Introduction 1 Chapter2 Zero-Sum Game 6 2.1 Two-person zero-sumgame 6 2.2 Minimax and maxmin 72.3 Saddle point 11 2.4 Matrixgamein pure strategies 13 2.5 Matrixgamein mixed strategies 15 2.6 Reductionofgame theoryto linear programming 16 Chapter3 Maxmin and MinimaxProblems 19 3.1 Maxmin problem 19 3.2 Optimality conditionsfor maxmin problem 21 3.3 Optimality conditions for minimax problem 25 Chapter4 Non-Zero Sum Game 31 4.1 Two-person non-zero sumgame 31 4.1.1 Bimatrixgame 31 4.1.2 Nash equilibrium 33 4.1.3 Berge equilibrium 38 4.2 Non-zero sum three-persongame 43 4.3 Non-zero sum four-persongame 48 4.4 Non-zero sum n-persongame 55 Chapter5 Anti-Nash and Anti-Berge Equilibriumin Bimatrix Game 59 5.1 Anti-Nash equilibriumin bimatrixgame 59 5.2 Anti-Berge equilibriumin bimatrixgame 63 Chapter6 Polymatrix Game 65 6.1 Three-sidedgame 65 6.1.1 Main propertiesof thegame Γ(A， B，C) 666.1.2 Optimization formulationof three-sidedgame 696.2 Four-players triplegame 72 6.3 Game of N-players 79 6.3.1 Nash theorem and the optimization problem 81 Chapter7 N-Players Non-Cooperative Games 85 7.1 Non-cooperativegames 85 7.2 Generalized Nash equilibrium problems 87 7.3 Someequivalent approachto generalizedNash equilibrium problems 89 897.3.1 Variational inequality approach7.3.2 Nikaido-Isoda function based approach 90 7.3.3 Karush-Kuhn-Tucker conditions approach 927.4 Global optimization D.Capproach to quadratic nonconvex generalized Nash equilibrium problems 94 7.4.1 Generalized Nash equilibrium problem and equivalent optimization formulation 947.4.2 Quadratic nonconvexgame andgap function 967.4.3 D.Coptimization approachto non-cooperativegame 100 7.5 Generalized Nash equilibrium problem based on Malfatti’s problem 103 7.5.1 Malfatti’s problemand convex maximization 104 7.5.2 Generalized Nash equilibrium problems 1057.6 Aglobal optimization approach to Berge equilibrium based on a regularized function 109 7.6.1 Existence of Berge equilibrium and constrained optimization reformulations 110 Chapter8 Game Theory and Hamiltonian System 116 8.1 Hamiltonian system 116 8.2 Evolutionarygames and Hamiltonian systems.119 8.3 Optimal controltheoryandthe Hamiltonian operator 121 8.4 Differentialgames and the Hamilton-Jacobi-Bellman (HJB) Principle 122 8.4.1 The relationship betweengame theoryandthe Hamiltonian operator 124 8.4.2 Two-person zero-sum differentialgames 125 8.4.3 Two-person non-zero sum differentialgames 127Chapter9 Computational Methods and Algorithmsfor Matrix Game 132 9.1 D.Cprogramming approachtoBerge equilibrium 132 9.1.1 Local search method 1339.1.2 Global search method 1349.1.3 Numerical results for D.Cprogramming approach to Berge equilibrium 137 9.2 Global search method curvilinear algorithm forgame 142 9.2.1 The curvilinear global search algorithm 142 9.2.2 Numerical results for three-persongame 145 9.2.3 Numerical results for four-persongame 1479.2.4 Numerical results N-persongame 149 9.3 The numerical approach for anti-Nash equilibrium search 152 9.3.1 The modi.ed Rosenbrock algorithm 153 9.3.2 Theunivariate global search procedure 154 9.3.3 Numerical results for anti-Nash equilibriumby Rosenbrock algorithm 156 9.4 Modi.ed parallel tangent algorithm for anti-Berge equilibrium 159 9.4.1 The modi.ed parallel tangent algorithm 160 9.4.2 Theunivariate global search procedure 161 9.4.3 Numerical results for anti-Berge equilibrium by modi.ed tangent algorithm 162 9.5 The curvilinear multistart algorithmfor polymatrixgame 166 9.5.1 Numericalexperimentof polymatrixgame 169 9.6 Numerical resultsfor non-cooperativegame 171 9.7 Numerical resultsforMalfati’s problem 175 Bibliography 182
購物車/收銀台(0) | 在線留言板
| 付款方式
| 運費計算
| 聯絡我們
| 幫助中心 |
加入書簽
HOME
新書上架
