基于进化博弈视角的水源地与下游生态补偿合作演化分析

水源地与下游地方政府之间的协议合作可以协调流域上下游之间的矛盾和利益,是一种可实现流域生态保护良性循环的生态补偿尝试。本文应用进化博弈的双种群博弈理论,研究了水源地和下游地方政府之间博弈演化过程及影响因素。研究表明,流域上下游地方政府合作的演化方向主要受水源地不保护及下游不补偿受到的惩罚、下游对水源地的补偿额度、水源地和下游合作的初始成本、水源地生态保护的成本及收益等八个因素的影响。降低水源地的保护成本及水源地和下游合作的初始成本,提高水源地因保护而获得的综合效益、提高水源地不保护及下游不补偿受到的惩罚额度、合理确定下游对水源地的补偿额度将有利于水源地生态补偿机制向合作方向演进。     

On optimal dividends with exponential and linear penalty payments

We study the optimal dividend problem where the surplus process of an insurance company is modelled by a diffusion process. The insurer is not ruined when the surplus becomes negative, but penalty payments occur, depending on the level of the surplus. The penalty payments shall avoid that losses can rise above any number and can be seen as a preference measure or costs for negative capital. As examples, exponential and linear penalty payments are considered. It turns out that a barrier dividend strategy is optimal.     

AN EFFICIENT SEQUENTIAL DESIGN FOR SENSITIVITY EXPERIMENTS

In sensitivity experiments, the response is binary and each experimental unit has a critical stimulus level that cannot be observed directly. It is often of interest to estimate extreme quantiles of the distribution of these critical stimulus levels over the tested products. For this purpose a new sequential scheme is proposed with some commonly used models. By using the bootstrap repeated-sampling principle, reasonable prior distributions based on a historic data set are specified. Then, a Bayesian strategy for the sequential procedure is provided and the estimator is given. Further, a high order approximation for such an estimator is explored and its consistency is proven. A simulation study shows that the proposed method gives superior performances over the existing methods.     

Complex adaptive systems and game theory: An unlikely union

A Complex Adaptive System is a collection of autonomous, heterogeneous agents, whose behavior is defined with a limited number of rules. A Game Theory is a mathematical construct that assumes a small number of rational players who have a limited number of actions or strategies available to them. The CAS method has the potential to alleviate some of the shortcomings of GT. On the other hand, CAS researchers are always looking for a realistic way to define interactions among agents. GT offers an attractive option for defining the rules of such interactions in a way that is both potentially consistent with observed real‐world behavior and subject to mathematical interpretation. This article reports on the results of an effort to build a CAS system that utilizes GT for determining the actions of individual agents. © 2009 Wiley Periodicals, Inc. Complexity, 16,24–42, 2010     

Tracking problem under a time-varying topology

This paper studies the multi-agent tracking problem of a third-order maneuvering target under uncertain communication environments. Each tracking agent is assumed to be a third-order system and can only use its own and neighbors＇ position, velocity, and acceleration information to design its control input. In this work, the uncertain communication environments are modelled by a finite number of constant Laplacian matrices together with their corresponding scheduling functions. Sufficient conditions for the existence of a tracking strategy have been expressed in terms of the solvability of linear matrix inequalities. Finally, a numerical example is employed to demonstrate the effectiveness of the proposed tracking strategy.     

Convergence of the shifted algorithm for unitary Hessenberg matrices

This paper shows that for unitary Hessenberg matrices the algorithm, with (an exceptional initial-value modification of) the Wilkinson shift, gives global convergence; moreover, the asymptotic rate of convergence is at least cubic, higher than that which can be shown to be quadratic only for Hermitian tridiagonal matrices, under no further assumption. A general mixed shift strategy with global convergence and cubic rates is also presented.

     

Parallelization of a Two-Phase Metaheuristic for Routing Problems with Time Windows

This paper describes the parallelization of a two-phase metaheuristic for the vehicle routing problem with time windows and a central depot (VRPTW). The underlying objective function combines the minimization of the number of vehicles in the first search phase of the metaheuristic with the minimization of the total travel distance in the second search phase. The parallelization of the metaheuristic follows a type 3 parallelization strategy (cf. Crainic and Toulouse (2001). In F. Glover and G. Kochenberger (eds.). State-of-the-Art Handbook in Metaheuristics. Norwell, MA: Kluwer Academic Publishers), i.e. several concurrent searches of the solution space are carried out with a differently configured metaheuristic. The concurrently executed processes cooperate through the exchange of solutions. The parallelized two-phase metaheuristic was subjected to a comparative test on the basis of 358 problems from the literature with sizes varying from 100 to 1000 customers. The derived results seem to justify the proposed parallelization concept.     

Hedging of the European option in discrete time under proportional transaction costs

In the paper hedging of the European option in a discrete time financial market with proportional transaction costs is studied. It is shown that for a certain class of options the set of portfolios which allow to hedge an option in a discrete time model with a bounded set of possible changes in a stock price is the same as the set of such portfolios, under assumption that the stock price evolution is given by a suitable CRR model.     

On existence of undominated pure strategy Nash equilibria in anonymous nonatomic games: a generalization

In this paper, we generalize the exitence result for pure strategy Nash equilibria in anonymous nonatomic games. By working directly on integrals of pure strategies, we also generalize, for the same class of games, the existence result for undominated pure strategy Nash equilibria even though, in general, the set of pure strategy Nash equilibria may fail to be weakly compact. Received August 2001     

关于拓扑对策中的I~2(K)I(K)问题

证明了如果空间类κ为D-空间类或闭遗传不可约空间类,则I(κ)(∈)κ.这一结果对于κ为D空间类和闭遗传不可约空间类,肯定地回答了I(κ)是否包含I2(κ)问题.