您要查找的是不是:
- An algorithm is proposed to solve the Nash equilibrium solution for an n-person noncooperative dynamic game by an annealing recurrent neural network for extremum seeking algorithm(ESA). 针对如何解算n人非合作的动态博弈对策中的纳什均衡解问题,提出一种利用退火回归神经网络极值搜索算法解算纳什均衡解的方法。
- An algorithm is proposed to solve the Nash equilibrium solution for an n-person noncooperative dynamic game by an annealing recurrent neural network for extremum seeking algorithm (ESA). 摘要针对如何解算n人非合作的动态博弈对策中的纳什均衡解问题,提出一种利用退火回归神经网络极值搜索算法解算纳什均衡解的方法。
- feedback Nash equilibrium solution 反馈纳什均衡解
- Nash Equilibrium Solution of Two-person Non-cooperative Game 两人非合作对策的纳什均衡解
- The Nash Equilibrium Solution Based on Optimum Function in Electricity Market 基于最优函数的电力市场Nash均衡解
- Nash Equilibrium Solution by Extremum Seeking Algorithm Based on Annealing Recurrent Neural Network 利用退火回归神经网络极值搜索算法求纳什均衡解
- It is a refinement of the Nash equilibrium concept. 它是纳什均衡概念的一种精炼。
- How to find Nash Equilibrium in a ZeroSum Game? 如何在一个零和博弈中找到纳什均衡?
- This is the Nash equilibrium of this game. 这也就是博弈的纳什均衡。
- Nash Equilibrium is the solution concept used to solve simultaneous-move games. 纳什均衡是同时博弈中使用的解概念。
- Nash equilibrium solution Nash均衡解
- A Nash equilibrium relies on the rationality of each player. 纳什均衡依赖于每个参与者的理性。
- In general, games need not have unique Nash equilibrium. 一般来说,博弈未必只有唯一均衡。
- Nash equilibrium is one kind of game solution concept,may make the strict many forecasts to extremely widespread type game. 纳什均衡是一种博弈的解的概念,可以对非常广泛类型的博弈作出严格的多的预测。
- Before reform of property rights,perfect Nash equilibrium of sub gaming was not optimal;Pareto dominance could be improved by bargaining solution. 公立医院改制前双方博弈的子博弈精炼纳什均衡为非帕雷托最优合同,可通过讨价还价实现帕雷托改进。
- A Nash equilibrium does not have to be jointly best for the players. 纳什均衡不要求对于所有参与者加起来最好。
- The model of stone, shears and cloth game is built. A solution of the Nash equilibrium strategy is gained, then in the base of matrix game theory imported, and in virtue of diagrammatizing ways and means ,an optimization strategy of the game is gained. 首先建立了石头、剪子、布博弈模型,获得了Nash均衡策略解,然后在引入矩阵对策理论的基础上,借助图解法寻找了该博弈的最优策略。
- In that case, we would analyze the game by searching for a Nash equilibrium rather than for a rollback equilibrium. 这样,我们就得去寻找纳什均衡而非反转均衡。
- Nash equilibrium requires each player to be confident about the other's choice of strategy. 纳什均衡要求每个参与者能够确信对手的策略选择。