不确定条件下n人非合作博弈均衡点集的通有稳定性

基于经典博弈模型的Nash均衡点集的通有稳定性和具有不确定参数的n人非合作博弈均衡点的概念,探讨了具有不确定参数博弈的均衡点集的通有稳定性.参照Nash均衡点集稳定性的统一模式,构造了不确定博弈的问题空间和解空间,并证明了问题空间是一个完备度量空间,解映射是上半连续的,且解集是紧集（即usco（upper semicontinuous and compact-valued）映射）,得到不确定参数博弈模型的解集通有稳定性的相关结论.     

可行策略对应的图像拓扑下广义博弈Nash平衡的稳定性

以往关于广义博弈Nash平衡的稳定性的研究,均利用可行策略映射之间的一致度量.现考虑在更弱的度量下,利用可行策略映射图像之间的Hausdorff距离定义度量.在此弱图像拓扑下,证明了广义博弈空间的完备性,以及Nash平衡映射的上半连续性和紧性,进而得到广义博弈Nash平衡的通有稳定性.即在Baire分类的意义下,大多数的广义博弈都是本质的.     

政府规制下的第三方废旧手机回收演化博弈分析

为研究废旧手机回收的政府决策问题,构建政府与第三方回收商行为决策的演化博弈模型,并对模型的稳定性进行了分析,在此基础上研究了政府对第三方回收商回收行为的动态惩罚和补偿策略,分析了政府与第三方回收商回收策略的互动机制.结果表明:政府对第三方回收商回收行为选择的相对应的回收策略的奖惩程度、第三方回收商选择的回收策略的成本与收益均直接影响演化博弈结果;当政府对第三方回收商选择相对应的动态惩罚或补偿策略时,演化博弈存在稳定Nash均衡点.     

BNN动力学下一类连续博弈均衡解的存在性及稳定性

本文研究了一类连续博弈解的存在性及稳定性.利用BNN动力学理论和方法,将演化博弈论中的几个经典例子:鹰-鸽博弈、协调博弈和猜硬币博弈转化为连续型支付函数的连续博弈后,获得了鹰-鸽连续博弈的Nash平衡点是演化稳定和连续稳定的,推广了文献[8]中关于演化博弈Nash平衡点及稳定性结果.     

主从博弈的轻微利他平衡点

针对一个领导者的主从博弈问题,研究轻微利他平衡点的存在性问题.首先,基于非合作博弈Nash均衡的概念,给出了主从博弈轻微利他Nash均衡的定义;然后,应用非线性问题稳定性理论,证明了平衡点的存在性.     

奇异随机Markov跳变系统的N人Nash博弈问题

分别研究了有限时间和无限时间情形下的一类奇异随机Markov跳变系统的N人微分博弈问题.利用配方法,得到了有限时间N人博弈的Nash均衡策略的微分Riccati方程,证明了Nash均衡策略的存在条件等价于微分Riccati方程存在解;无限时间内,N人博弈的Nash均衡策略的存在条件等价于代数Riccati方程存在解,并分别给出了均衡策略的显式表达及最优性能泛函值.最后,将所得的结果应用于现代鲁棒控制中的随机H_2/H_∞控制问题,得到了鲁棒控制策略的存在条件及显式表达.     

复杂产业网络上的技术创新博弈扩散研究

创新的价值在于扩散,但扩散依赖于路径选择与扩散规则.提出了技术创新扩散的一对多博弈模型,并求解出了Nash均衡解.Nash均衡表明,传播者采取扩散策略的概率与学习者的学习成本和拒绝代价之差成正比;学习者采取学习策略的概率不但与传播者的封锁成本成正比,而且与网络的平均度成正比;进而,基于马尔科夫链的吸收态,进一步分析了产业网络上技术创新博弈扩散的平均步数;基于平均场理论,分析了产业网络上技术创新博弈扩散的分布及其分布密度.最后,通过长三角IC产业网络给出了实证分析.     

不确定性下强Berge均衡的存在性

在已知不确定参数变化的范围下,研究了非合作博弈与广义非合作博弈的强Berge均衡的存在性,基于强Berge均衡与不确定性下非合作博弈的强Nash均衡的概念,给出了不确定参数下非合作博弈与广义非合作博弈的强Berge均衡的定义,并利用Fan-Glicksberg不动点定理证明其存在性,最后用算例验证其可行性.     

基于复杂网络演化博弈的企业低碳创新合作行为网络演化机理研究

针对企业低碳创新合作所面临的复杂问题,基于现实复杂网络结构特征,运用演化博弈理论研究有限理性下企业低碳创新合作行为网络演化机理,利用Matlab仿真技术探究无标度网络载体上微观因素对低碳创新合作行为的影响。研究结果表明:低碳创新利益分配、协同效益和违约惩罚对低碳创新合作行为网络演化结果的影响最为显著,网络规模越大网络演化速度越慢,网络规模越小对协同系数和利益分配系数的敏感性越强,网络规模越大对技术溢出系数和违约惩罚的敏感性越强。研究结论可以为企业低碳创新合作策略制定提供解决依据。     

考虑随机干扰的政企救灾协同策略研究

考虑了随机干扰因素对政企协同救灾策略的影响,建立了Nash非合作博弈,成本分担Stackelberg博弈和协同合作契约三种随机微分博弈模型,并分别求得了Nash非合作博弈、Stackelberg主从博弈和协同合作博弈情形下的最优救灾策略及收益.通过对比分析均衡结果,发现:协同合作情形下的期望值和方差最大,成本分担情形的期望值和方差次之,无成本分担期望值和方差最小,说明在随机因素的干扰下,政府和企业要想获得更高的系统效益,就需要承担更大的风险,收益与风险相伴随.同时发现,随机因素干扰使得真实值与其预期值存在偏差,但在一定可信度下,它们总是围绕期望值波动并且被控制在一定范围内.     

约束形式下广义最大元Nash均衡的存在性

运用广义最大元方法在非传递性偏好下给出了博弈均衡的存在性定理,推广了一些经典的博弈均衡存在性定理.在文中介绍策略式博弈的Nash均衡具有宽泛的条件,在微观经济理论中有广泛的应用.     

Computing Nash equilibria through computational intelligence methods

Nash equilibrium constitutes a central solution concept in game theory. The task of detecting the Nash equilibria of a finite strategic game remains a challenging problem up-to-date. This paper investigates the effectiveness of three computational intelligence techniques, namely, covariance matrix adaptation evolution strategies, particle swarm optimization, as well as, differential evolution, to compute Nash equilibria of finite strategic games, as global minima of a real-valued, nonnegative function. An issue of particular interest is to detect more than one Nash equilibria of a game. The performance of the considered computational intelligence methods on this problem is investigated using multistart and deflection.     

Structural satisfaction in simple games

A fundamental maxim for any theory of social behavior is that knowledge of the theory should not cause behavior that contradicts the theory's assertions. Although this maxim consistently has been heeded in the theory of noncooperative games, it largely has been ignored in solution theory for cooperative games. Solution theory, the central concern of this paper, seeks to identify a subset of the feasible outcomes of a cooperative game that are ‘stable’ results of competition among participants, each of whom attempts to bring about an outcome he favors, rather than to prescribe ‘fair’ outcomes that accord with a standard of equity. We show that learning by participants about the solution theory can cause the outcomes identified as stable by certain solution concepts to become unstable, and discover that an important distinction in this regard is whether the solution concept requires each element of the solution set to defend itself against alternatives rather than relying on other elements for its defense. Finally, we develop a concept of ‘solid’ solutions which have a special claim for stability.The unifying theme of this paper concerns the sense in which certain outcomes of a cooperative game may be regarded as stable, and the extent to which this stability requires that the players are ignorant of the theory. Although the issues raised here have implications for the theory of cooperative games in general, Section 1 establishes the focus of the analysis on collective decision games. Section 2 develops some general perspectives on solution theory which are used in Sections 3 and 4 to evaluate the Condorcet solution, the core, the robust proposals set, von Neumann- Morgenstern solutions and competitive solutions. Section 5 presents the concept of a solid solution and relates this idea to the solution concepts reviewed earlier. We demonstrate that in general a solution concept has a strong claim to stability only if it is solid. Finally, Section 6 concludes by indicating that the basic argument also can be applied to Aumann and Maschler's bargaining sets and, more generally, to solution theory for any cooperative game.     

Strategically supported cooperation in dynamic games with coalition structures

The problem of strategic stability of long-range cooperative agreements in dynamic games with coalition structures is investigated. Based on imputation distribution procedures, a general theoretical framework of the differential game with a coalition structure is proposed. A few assumptions about the deviation instant for a coalition are made concerning the behavior of a group of many individuals in certain dynamic environments.From these, the time-consistent cooperative agreement can be strategically supported by ε-Nash or strong ε-Nash equilibria. While in games in the extensive form with perfect information, it is somewhat surprising that without the assumptions of deviation instant for a coalition, Nash or strong Nash equilibria can be constructed.     

Two noncooperative games between a coalition and its surrounding in a class of n-person games with constant sum

A cooperative game engendered by a noncooperative n-person game (the master game) in which any subset of n players may form a coalition playing an antagonistic game against the residual players (the surrounding) that has a (Nash equilibrium) solution, is considered, along with another noncooperative game in which both a coalition and its surrounding try to maximize their gains that also possesses a Nash equilibrium solution. It is shown that if the master game is the one with constant sum, the sets of Nash equilibrium strategies in both above-mentioned noncooperative games (in which a coalition plays with (against) its surrounding) coincide.     

Persistent equilibria in strategic games

A perfect equilibrium [Selten] can be viewed as a Nash equilibrium with certain properties of local stability. Simple examples show that a stronger notion of local stability is needed to eliminate unreasonable Nash equilibria. The persistent equilibrium is such a notion. Properties of this solution are studied. In particular, it is shown that in each strategic game there exists a pesistent equilibrium which is perfect and proper.     

Non-binding agreements and fairness in commons dilemma games

Usually, common pool games are analyzed without taking into account the cooperative features of the game, even when communication and non-binding agreements are involved. Whereas equilibria are inefficient, negotiations may induce some cooperation and may enhance efficiency. In the paper, we propose to use tools of cooperative game theory to advance the understanding of results in dilemma situations that allow for communication. By doing so, we present a short review of earlier experimental evidence given by Hackett, Schlager, and Walker 1994 (HSW) for the conditional stability of non-binding agreements established in face-to-face multilateral negotiations. For an experimental test, we reanalyze the HSW data set in a game-theoretical analysis of cooperative versions of social dilemma games. The results of cooperative game theory that are most important for the application are explained and interpreted with respect to their meaning for negotiation behavior. Then, theorems are discussed that cooperative social dilemma games are clear (alpha- and beta-values coincide) and that they are convex (it follows that the core is “large”): The main focus is on how arguments of power and fairness can be based on the structure of the game. A second item is how fairness and stability properties of a negotiated (non-binding) agreement can be judged. The use of cheap talk in evaluating experiments reveals that besides the relation of non-cooperative and cooperative solutions, say of equilibria and core, the relation of alpha-, beta- and gamma-values are of importance for the availability of attractive solutions and the stability of the such agreements. In the special case of the HSW scenario, the game shows properties favorable for stable and efficient solutions. Nevertheless, the realized agreements are less efficient than expected. The realized (and stable) agreements can be located between the equilibrium, the egalitarian solution and some fairness solutions. In order to represent the extent to which the subjects obey efficiency and fairness, we present and discuss patterns of the corresponding excess vectors.     

The solution of evolutionary games using the theory of Hamilton-Jacobi equations

A dynamical model of a non-antagonistic evolutionary game for two coalitions is considered. The model features an infinite time span and discounted payoff functionals. A solution is presented using differential game theory. The solution is based on the construction of a value function for auxiliary antagonistic differential games and uses an approximate grid scheme from the theory of generalized solutions of the Hamilton-Jacobi equations. Together with the value functions the optimal guaranteeing procedures for control on the grid are computed and the Nash dynamic equilibrium is constructed. The behaviour of trajectories generated by the guaranteeing controls is investigated. Examples are given.     

Threat bargaining games with a variable population

In this paper we establish links between desirable properties satisfied by familiar solutions to bargaining games with a variable population and the Nash equilibrium concept for threat bargaining games. We introduce three new concepts for equilibrium threat strategies called strategic stability, strategic monotonicity with respect to changes in the number of agents and strategic constancy. Our primary objective in this paper is to show that familiar assumptions satisfied by bargaining games with a variable population yield equilibrium threat strategies which satisfies in a very natural way the concepts we have introduced.