An Approach to Fuzzy Noncooperative Nash Games

Systems that involve more than one decision maker are often optimized using the theory of games. In the traditional game theory, it is assumed that each player has a well-defined quantitative utility function over a set of the player decision space. Each player attempts to maximize/minimize his/her own expected utility and each is assumed to know the extensive game in full. At present, it cannot be claimed that the first assumption has been shown to be true in a wide variety of situations involving complex problems in economics, engineering, social and political sciences due to the difficulty inherent in defining an adequate utility function for each player in these types of problems. On the other hand, in many of such complex problems, each player has a heuristic knowledge of the desires of the other players and a heuristic knowledge of the control choices that they will make in order to meet their ends.In this paper, we utilize fuzzy set theory in order to incorporate the players' heuristic knowledge of decision making into the framework of conventional game theory or ordinal game theory. We define a new approach to N-person static fuzzy noncooperative games and develop a solution concept such as Nash for these types of games. We show that this general formulation of fuzzy noncooperative games can be applied to solve multidecision-making problems where no objective function is specified. The computational procedure is illustrated via application to a multiagent optimization problem dealing with the design and operation of future military operations.     

An Extension of the Coordinate Transformation Method for Open-Loop Nash Equilibria

In Leitmann (Ref. 1), a coordinate transformation method was introduced to obtain global solutions for free problems in the calculus of variations. This direct method was extended and broadened in Carlson (Ref. 2) and later in Leitmann (Ref. 3). The applicability of the original work of Leitmann (Ref. 1) was further developed in Dockner and Leitmann (Ref. 4) to include the class of open-loop dynamic games. In the present work, we improve the results of Ref. 4 in two directions. First, we enlarge the class of open-loop dynamic games to permit coupling among the dynamic equations via the states of the players; second, we incorporate the modifications given in Refs. 2 and 3. Our results greatly increase the applicability of this method. An example arising from the harvesting of a renewable resource is presented to illustrate the utility of our results.     

Multicriteria Goal Games

In this paper, we deal with multicriteria matrix games. Different solution concepts have been proposed to cope with these games. Recently, the concept of Pareto-optimal security strategy which assures the property of security in the individual criteria against an opponent's deviation in strategy has been introduced. However, the idea of security behind this concept is based on expected values, so that this security might be violated by mixed strategies when replications are not allowed. To avoid this inconvenience, we propose in this paper a new concept of solution for these games: the G-goal security strategy, which includes as part of the solution the probability of obtaining prespecified values in the payoff functions. Thus, attitude toward risk together with payoff values are considered jointly in the solution analysis.     

Modifications of the Wolfe Line Search Rules to Satisfy Second-Order Optimally Conditions in Unconstrained Optimization

The line search method incorporating the Wolfe conditions is modified to ensure that a descent algorithm terminates in a finite number of steps at an approximate stationary point where the second-order conditions of optimality are satisfied. A simple procedure based on conjugate directions is proposed to determine directions of negative curvature.     

An efficient algorithm for elasto-viscoplastic vibrations of multi-layered composite beams using second-order theory

An efficient time-domain algorithm for plane non-linear flexural vibrations of multi-layered composite beams, which are driven into the inelastic range by severe transverse loadings, is presented. The influence of an axial static preload is considered in the sense of the quasi-linear second-order theory of structures. The inelastic parts of strain are treated as additional sources of selfstress in the linear elastic background-structure, driving the elastic response into the inelastic one. The efficiency of this exact formulation lies in the fact that linear solution techniques can be used in their most powerful form: Rubin's useful formulation for the quasi-static second-order transfer-matrix of linear elastic structures is applied in combination with modal analysis. Having in mind multi-metal beams, the classical lamination theory is assumed to be valid. Beams with overhang composed of ideal elastic-plastic and viscoplastic layers are studied as example structures. The fictitious sources of selfstress are calculated from the different material laws of the layers in a numerical time-stepping procedure, where a generalized midpoint-rule in combination with Crisfield's secant-Newton procedure is used.     

Model-Free Analysis of Mixtures by NMR Using Blind Source Separation

The concept of blind source separation is described and examples of its use in 1D and 2D NMR spectroscopy are presented. The goal of this data processing method is to extract the spectra of components molecules when only mixtures are available.     

半正二阶三点边值问题的解和正解

考察了非线性二阶三点边值问题的n个解和正解的存在性,其中允许非线性项有一个负的下界并且n是一个任意的自然数．主要结论表明该问题可以具有n个解或者正解,只要非线性项在某些有界集上的“高度”是适当的．     

Second-order necessary optimality conditions for domain optimization problems of the Neumann type

In this paper, we treat a domain optimization problem in which the boundary-value problem is a Neumann problem. In the case where the domain is in a three-dimensional Euclidean space, the first-order and the second-order necessary conditions which the optimal domain must satisfy are derived under a constraint which is the generalization of the requisite of constant volume.Portions of this paper were presented at the 13th IFIP Conference on System Modelling and Optimization, Tokyo, Japan, 1987.     

Recursive solution of linear-quadratic Nash games for weakly interconnected systems

A recursive method is developed for the solution of coupled algebraic Riccati equations and corresponding linear Nash strategies of weakly interconnected systems. It is shown that the given algorithm converges to the exact solution with the rate of convergence ofO(²), where is a small coupling parameter. In addition, only low-order systems are involved in algebrdic computations; the amount of computations required does not grow per iteration and no analyticity assumption is imposed on the system coefficients.This work was supported by Rutgers University Research Council under Grant No. 2-02188.     

On sequential procedures for the point estimation of the mean of a normal population

The sequential procedures developed by Starr (1966, Ann. Math. Statist., 37, 1173–1185) for estimating the mean of a normal population are further analyzed. Asymptotic properties of the regret and first two moments of the stopping rules are studied and second-order approximations are derived.