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. 相似文献
The method of equivalent variational methods, originally due to Carathéodory for free problems in the calculus of variations is extended to investigate feedback Nash equilibria for a class of n-person differential games. Both the finite-horizon and infinite-horizon cases are considered. Examples are given to illustrate the presented results. 相似文献
We consider the following problem: given a set of points in the plane, each with a weight, and capacities of the four quadrants, assign each point to one of the quadrants such that the total weight of points assigned to a quadrant does not exceed its capacity, and the total distance is minimized.
This problem is most important in placement of VLSI circuits and is likely to have other applications. It is NP-hard, but the fractional relaxation always has an optimal solution which is “almost” integral. Hence for large instances, it suffices to solve the fractional relaxation. The main result of this paper is a linear-time algorithm for this relaxation. It is based on a structure theorem describing optimal solutions by so-called “American maps” and makes sophisticated use of binary search techniques and weighted median computations.
This algorithm is a main subroutine of a VLSI placement tool that is used for the design of many of the most complex chips. 相似文献
Differential game formulations provide an adequate basis for a guidance law synthesis against highly maneuvering targets. This paper deals with a guidance law based on a linear-quadratic differential game formulation. This guidance law has many attractive properties: it is continuous, linear with respect to the state variables, and its gain coefficients can be precalculated offline. Nevertheless, due to the lack of hard control constraints in the formulation, the magnitude of the control can exceed the admissible level imposed by the nature of the problem. In this paper, the upper bound of the interceptor control is obtained depending on the system parameters and the penalty coefficients of the game performance index. It is shown that the interceptor can guarantee an arbitrarily small miss distance without exceeding the control constraints if it has sufficient maneuverability and if the penalty coefficients are chosen properly. By manipulating the penalty coefficients, it is possible to reduce significantly the maneuverability requirements compared to the case of zero interceptor penalty coefficient. 相似文献
Defining speed of diffusion as the amount of time it takes to get from one penetration level to a higher one, we introduce a dynamic model in which we study the link between pricing policy, speed of diffusion, and number of competitors in the market. Our analysis shows that, in the case of strategic (oligopolistic) competition, the speed of diffusion has an important influence on the optimal pricing policy. In particular, we find that higher speeds of diffusion create an incentive to strategically interacting firms to lower their prices. 相似文献
Noncooperative games of a finite number of persons with interval-valued payoff functions are considered. The concept of an equilibrium situation is introduced. A reduction of such games to deterministic noncooperative games is proposed. Properties of the reduced games are discussed. Interval antagonistic and bimatrix games are examined, and illustrative examples are considered. 相似文献
In this note we study uncertainty sequencing situations, i.e., one-machine sequencing situations in which no initial order
is specified. We associate cooperative games with these sequencing situations, study their core, and provide links with the
classic sequencing games introduced by Curiel et al. (Eur J Oper Res 40:344–351, 1989). Moreover, we propose and characterize
two simple cost allocation rules for uncertainty sequencing situations with equal processing times. 相似文献
Using an infinite-horizon two-player differential game, we derive and compare Bertrand and Cournot equilibria for a differentiated duopoly engaging in the process of R&D competition. The main findings of this study are as follows. First, Bertrand competition is more efficient if either R&D productivity is low or products are very different. Second, Cournot competition is more efficient provided that R&D productivity is high, products are close substitutes, and spillovers are not close to zero. This last result is different from what has been obtained in the literature. Hence, this shows that considering a dynamic model and more general investment costs does have an impact on the efficiency results. 相似文献