The effects of resource limitation and consensual incentives on cooperation

Exploring the evolution of cooperation has been one of the most challenging topics and attracted increasing attention in various realms. Hereby, we institute an analytic model where the relationship between the common benefits and contributions is the typical saturation nonlinearity. We investigate the evolutionary dynamics of cooperation with and without consensual incentives respectively. The population always evolves to full defection when the incentives are absent. Cooperation, however, can be promoted by consensual incentives when the degree of cooperators' preferences for incentives is great. There exists an intermediate amount of resources at which the positive effect of consensual incentives on cooperation is minimized. Furthermore, there is a U-shape relationship between the degree of cooperators' preference for an incentive and the evolution of cooperation. A greater basin of full cooperation can be induced when the cooperators' preference for reward is more pronounced than that for punishment.     

油水两液相一维非等温渗流的传递分析

在求解油水两液相非等温渗流的温度场、压力场基础上,以驱动功、驱动功率、驱动阻力、驱动速率为特征参数,对该过程进行(火用)传递分析。数值模拟的结果表明:含水通过降低油的相对渗透率、从而增大驱动阻力、减小驱动功率, 最终导致原油产量降低。     

组织合作中关系专用性投资最优水平分析

本在以往研究的基础上对关系专用投资的价值创造功能作了进一步的讨论，分析了其创造准租金收入的机理和一般表示，在此基础上结合以往交易成本经济学对关系专用性投资的认识以及其作为沉没成本的特征，从效用最大化的角度建立了两个成员的联盟中关系专用性投资的决策模型，分析了关系专用性投资创造准租的具体特征对投资水平的影响。     

Second Order Nonlinear Evolution Inclusions Ⅰ： Existence and Relaxation Results

This is the first part of a work on second order nonlinear, nonmonotone evolution inclusions defined in the framework of an evolution triple of spaces and with a multivalued nonlinearity depending on both x（t） and x（t）. In this first part we prove existence and relaxation theorems. We consider the case of an usc, convex valued nonlinearity and we show that for this problem the solution set is nonempty and compact in C^1 （T, H）. Also we examine the Isc, nonconvex case and again we prove the existence of solutions. In addition we establish the existence of extremal solutions and by strengthening our hypotheses, we show that the extremal solutions are dense in C^1 （T, H） to the solutions of the original convex problem （strong relaxation）. An example of a nonlinear hyperbolic optimal control problem is also discussed.     

Hele-Shaw type problems with dynamical boundary conditions

In this paper, we study the nonlinear evolution equation of Hele-Shaw type with dynamical boundary conditions. That is, the equation ut=Δw+f where u∈H(w) and H is the Heaviside function, with boundary condition μ(x,w)t_∂w+k∇w⋅ν=g, where ν denotes the outward normal vector of the fixed boundary of the domain. We prove existence, uniqueness and some qualitative properties of the solution.     

基于模糊方法的多人合作对策的研究

多人合作对策模型中联盟的收入和总体的收入常常出现相互矛盾的情况 ,此时核是空集 .由于不存在核 ,无法用 Nash-Harsanyi谈判模型求解 .采用模糊数学方法 ,调整模型中线性约束的右端系数 ,使核在一定程度上是非空集合 ,得到模糊意义下的 Nash平衡解 .该方法一定程度上解决了各联盟收入与总体收入的矛盾 .最后通过一个算例说明该方法的可行性 .     

上市公司高管薪酬和企业业绩关系研究

本运用我国生物医药上市公司的经验数据考察高管薪酬与企业业绩的关系问题。研究的结果表明高管薪酬水平与企业业绩显正相关，高管团队内的薪酬差距也与企业业绩显正相关，而高管持股则与企业业绩负相关，在统计上不显。因此章建议企业应该考虑股权激励的成本和效果，改善股权激励制度。研究还表明企业追求的目标是规模最大化而不是股东净资产收益率最大化。     

Cooperative Strategies for Solving the Bicriteria Sparse Multiple Knapsack Problem

For hard optimization problems, it is difficult to design heuristic algorithms which exhibit uniformly superior performance for all problem instances. As a result it becomes necessary to tailor the algorithms based on the problem instance. In this paper, we introduce the use of a cooperative problem solving team of heuristics that evolves algorithms for a given problem instance. The efficacy of this method is examined by solving six difficult instances of a bicriteria sparse multiple knapsack problem. Results indicate that such tailored algorithms uniformly improve solutions as compared to using predesigned heuristic algorithms.     

COSEARCH: A Parallel Cooperative Metaheuristic

In order to design a well-balanced metaheuristic for robustness, we propose the COSEARCH approach which manages the cooperation of complementary heuristic methods via an adaptive memory which contains a history of the search already done. In this paper, we present the idiosyncrasies of the COSEARCH approach and its application for solving large scale instances of the quadratic assignment problem (QAP). We propose an original design of the adaptive memory in order to focus on high quality regions of the search and avoid attractive but deceptive areas. For the QAP, we have hybridized three heuristic agents of complementary behaviours: a Tabu Search is used as the main search algorithm, a Genetic Algorithm is in charge of the diversification and a Kick Operator is applied to intensify the search. The evaluations have been executed on large scale network of workstations via a parallel environment which supports fault tolerance and adaptive dynamic scheduling of tasks.