基于博弈演化算法的PMU最优配置方法

为实现电力系统可观测性,提出一种新的相量测量单元(PMU)配置方法,即基于博弈论的演化算法。该算法将寻找PMU最优配置方案的问题映射为理性主体寻求自身利益最大化的博弈过程,PMU最优配置方案即对应于博弈中的纳什均衡解。其突出优点是演化方向确定、全局收敛性好、收敛速度快、解具有多样性。应用该算法在IEEE 30节点、新英格兰39节点、某128节点系统进行仿真计算,与深度优化算法、模拟退火算法和最小生成树算法的结果进行比较,说明了该算法的可行性及优势。     

Game-theoretic solutions through intelligent optimization for efficient resource management in wireless visual sensor networks

We propose a quality-driven cross-layer optimization scheme for wireless direct sequence code division multiple access (DS-CDMA) visual sensor networks (VSNs). The scheme takes into account the fact that different nodes image videos with varying amounts of motion and determines the source coding rate, channel coding rate, and power level for each node under constraints on the available bit rate and power. The objective is to maximize the quality of the video received by the centralized control unit (CCU) from each node. However, since increasing the power level of one node will lead to increased interference with the rest of the nodes, simultaneous maximization of the video qualities of all nodes is not possible. In fact, there are an infinite number of Pareto-optimal solutions. Thus, we propose the use of the Nash bargaining solution (NBS), which pinpoints one of the infinite Pareto-optimal solutions, based on the stipulation that the solution should satisfy four fairness axioms. The NBS results in a mixed-integer optimization problem, which is solved using the particle swarm optimization (PSO) algorithm. The presented experimental results demonstrate the advantages of the NBS compared with alternative optimization criteria.     

供应链上游段集中控制型 VMI & TPL模式利益分配机制

以基本的“收益共享契约”为基础,以集中控制型VMI＆TPL模式为对象,研究供应链上游段各成员企业的协调。由于基本的收益共享契约不能对供应链进行有效协调,提出了基于风险共担的收益共享契约,但是该契约不能实现供应链各成员的期望收益的帕累托最优。为了改进这一缺陷,建立了基于不对称的Nash协商的风险共担型的收益共享契约模型。分析表明：该模型不仅克服了不能实现供应链各成员的期望收益达到帕累托最优的缺点,还可以实现各参与企业的期望收益的帕累托最优。     

双边电力市场的最后要价仲裁模型

针对双边电力市场环境下买卖双方逐利的目的,很难就固定的合同价格达成一致,利用在国际贸易领域已较成熟应用的仲裁模型,建立了双边电力市场中买卖双方报价的最后要价仲裁模型。应用此最后要价仲裁模型市场交易员能较好地控制电价,同时还可解决暗标拍卖所造成的价格波动,有效地抑制买卖双方因乱用市场力造成的电价飞涨,形成稳定的电力市场环境。     

Nash bargaining solution based multi-cell and multi-user interference alignment scheme for cellular networks

In wireless cellular networks, the interference alignment （IA） is a promising technique for interference management. A new IA scheme for downlink cellular network with multi-cell and multi-user was proposed, in the proposed scheme, the interference in the networks is divided into inter-cell interference （ICI） among cells and inter-user interference （IUI） in each cell. The ICI is aligned onto a multi-dimensional subspace by multiplying the ICI alignment precoding matrix which is designed by the singular value decomposition （SVD） scheme at the base station （BS） side. The aligned ICI is eliminated by timing the interference suppression matrix which is designed by zero-forcing （ZF） scheme at the user equipment （UE） side. Meanwhile, the IUI is aligned by multiplying the IUI alignment precoding matrix which is designed based on Nash bargaining solution （NBS） in game theory. The NBS is solved by the particle swarm optimization （PSO） method. Simulations show that, compared with the traditional ZF IA scheme, the proposed scheme can obtain higher data rate and guarantee the data rate fairness of UEs with little additional complexity.     

Nash模型参数估计的熵法

本文提出了一种Nash模型参数估计方法——熵法。该法以Nash模型的数学表达形式同于Γ分布为基础，应用最大信息熵原理，构造参数估计方程；然后将对数均值展为泰勒级数，并略去高阶项，导出相应的计算公式。通过假想水文资料检验这一方法，并与矩法的估计值相比较，结果表明本文提出的方法优于矩法。     

Re‐evaluation of the Optimal Operating Conditions for the Primary End of an Integrated Steel Plant using Multi‐objective Genetic Algorithms and Nash Equilibrium

Some existing work on optimizing the operational cost of the primary end of an integrated steel plant containing two blast furnaces utilizing both pellets and sinters, an electric furnace and a basic oxygen furnace was further advanced using a multi‐objective genetic algorithm, along with a Nash equilibrium analysis. The new formulation was able to improve the earlier results very significantly, suggesting the efficacy of the multi‐objective approach over the more conventional single objective genetic algorithms.     

Disturbance Attenuation in Hyperbolic 2D-systems

We consider disturbed linear 2D-systems of Fornasini–Marchesini type in the continuous time case. These systems are also named Goursat-type systems. Conditions for unique solvability of the disturbed optimal control problem with a quadratic cost functional are obtained. The disturbed or worst case optimal control guarantees to minimize the cost functional for any unknown disturbance input. In a second part then we consider a disturbance attenuation by boundary controls, i.e., by using the Goursat-data as control functions. In the 2D-case this results in two control functions acting independently on the system. We study a cooperative and a non-cooperative situation. In the cooperative situation we again obtain a disturbed optimal control problem and get conditions for existence and uniqueness of such a disturbed optimal control problem. If the action of the agents is non-cooperative we assume that it is agreed that they act on an open-loop Nash/worst-case equilibrium strategy. Sufficient conditions for the existence of such an equilibrium are obtained. Published online: April 2006     

Repeated Play of Potential Games

So-called potential functions are important, prominent, and common to many diverse fields, including optimization, dynamic processes, and physics. Monderer and Shapley have added a class of noncooperative games to that list. In the present paper, their notion is extended and repeated play of such games is considered. A unified convergence analysis is provided and procedures that account for efficiency or viability are shown.     

基于随机理论的Nash单位线研究

应用随机理论对Nash单位线进行分析研究，把模型参数Ⅸ看作是随机变量，推导出Nash随机S曲线的公式并应用于沿渡河流域的汇流计算中。应用这种方法模拟降雨径流过程能同时给出出流过程均值和方差。