Fuzzy矩阵方程的摄动问题

讨论了Fuzzy矩阵A的同解简化矩阵A^(2)，指出陈贻源论文《解Fuzzy关系方程》中定量3的错误。研究Fuzzy矩阵方程的摄动问题，解决了汤服成（2000）提出的未解决问题。     

Game of two cars: Case of variable speed

A stochastic version of Isaacs's (Ref. 1) game of two cars is dealt with here. In this version, the pursuer, owing to thrust and drag forces, has a variable speed, whereas the evader's speed is constant. Also, the pursuer can maneuver as long as his speed is bounded by some lower and upper limits. The probability of interception, corresponding to optimal (saddle-point) feedback strategies, is computed and serves as a reference for evaluating the performance of four different versions of the proportional navigation pursuit law as well as two other strategies.     

The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands

By showing that there is an upper bound for the price of anarchyρ(Γ) for a non-atomic congestion game Γ with only separable cost maps and fixed demands, Roughgarden and Tardos show that the cost of forgoing centralized control is mild. This letter shows that there is an upper bound for ρ(Γ) in Γ for fixed demands with symmetric cost maps. It also shows that there is a weaker bound for ρ(Γ) in Γ with elastic demands.     

Subgame Consistent Cooperative Solutions in Stochastic Differential Games

Subgame consistency is a fundamental element in the solution of cooperative stochastic differential games. In particular, it ensures that: (i) the extension of the solution policy to a later starting time and to any possible state brought about by the prior optimal behavior of the players would remain optimal; (ii) all players do not have incentive to deviate from the initial plan. In this paper, we develop a mechanism for the derivation of the payoff distribution procedures of subgame consistent solutions in stochastic differential games with transferable payoffs. The payoff distribution procedure of the subgame consistent solution can be identified analytically under different optimality principles. Demonstration of the use of the technique for specific optimality principles is shown with an explicitly solvable game. For the first time, analytically tractable solutions of cooperative stochastic differential games with subgame consistency are derived.     

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.     

Apparatus for High-Resolution Solid Hydrogen Matrix Isolation Spectroscopy and Its Application

Apparatus integrating a Fourier transform-infrared (FT-IR) spectrometer and a mid-infrared difference frequency generation (DFG) laser spectrometer was built for the study of the matrix isolation spectrum in solid molecular hydrogen. A 3-cm-long molecular hydrogen crystal was grown in a liquid-helium Dewar, and its infrared absorption spectrum in the 1-5 μm region was recorded to test the system. The W₀(0) (ν=0←0, J=6←0) line around 2410 cm⁻¹ of solid hydrogen was investigated with the DFG laser spectroscopy. High-resolution matrix isolation spectrum of CO² co-deposited with hydrogen on a BaF₂ cold plate at liquid-helium temperature was studied.     

ON MATRIX UNITARILY INVARIANT NORM CONDITION NUMBER

1.IntroductionSince1984,severalchinesemathematicianshaveobtailledmanyresultsboutmatrixoperatornormcondition.umbe.[ll'12'18].Twokindsmatrixconditionnllmbers[9]are:(1)IfAECoxsisnonsingular,thellunlberK.(A)~IIAll.llA--'if.iscalledtheor--normconditionnumberof…     

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.     

THE NECESSARY AND SUFFICIENT CONDITIONS FOR THE SOLVABILITY OF A CLASS OF THE MATRIX INVERSE PROBLEM

Censider the solutions of the matrix inverse problem, which are symmetric positive semide finite on a subspace. Necessary and sufficient conditions for the solvability, as well as the general solution are obtained. The best approximate solution by the above solution set is given. Thus the open problem in [1] is solved.