Multi-agent systems comprise entities whose individual decision making behavior may depend on one another's. Game-theory provides apposite concepts to reason in a math.matically precise fashion about such interact...
详细信息
Multi-agent systems comprise entities whose individual decision making behavior may depend on one another's. Game-theory provides apposite concepts to reason in a math.matically precise fashion about such interactive and interdependent situations. This paper concerns a logical analysis of the game-theoretical notions of Nash equilibrium and its subgame perfect variety as they apply to a particular class of extensive games of perfect information. Extensive games are defined as a special type of labelled graph and we argue that modal languages can be employed in their description. We propose a logic for a multi-modal language and prove its completeness with respect to a class of frames that correspond with a particular class of extensive games. In this multimodal language (subgame perfect) Nash equilibria can be characterized. Finally, we show how this approach can formally be refined by using Prepositional Dynamic Logic (PDL), though we leave completeness as an open question.
Generalized Net (GNs) are extensions of the ordinary Petri nets and of the other Petri net modifications, while the Intuitionistic Fuzzy Sets (IFSs) are extensions of the fuzzy sets. A GN-model of a process of the IF ...
详细信息
ISBN:
(纸本)905809524X
Generalized Net (GNs) are extensions of the ordinary Petri nets and of the other Petri net modifications, while the Intuitionistic Fuzzy Sets (IFSs) are extensions of the fuzzy sets. A GN-model of a process of the IF approach of the multi-persion multi-criteria decision making is constructed and some of its applications are discussed.
The application of a novel branch of Computational Cybernetics is extended to the adaptive control of very inaccurately and partly modeled electromechanical systems also having unmodeled non-linear dynamic coupling wi...
详细信息
The application of a novel branch of Computational Cybernetics is extended to the adaptive control of very inaccurately and partly modeled electromechanical systems also having unmodeled non-linear dynamic coupling with their environment. The method uses "uniform structures" for modeling, and "uniform procedures" for "repetitive" or cumulative learning like in the case of the "traditional" soft computing approaches. But it considerably reduces the number of free parameters to be set, and also replaces the process of parameter tuning with simple, lucid, and explicit algebraic operations of limited number of steps. It is demonstrated via simulation that the control can operate even if strongly nonlinear terms (Coulomb friction and sticking combined with the elastic and viscous terms of the unmodeled external interaction in the Stribeck model), and elastically deformable joints are present. As a paradigm a mechanically 3 DOF SCARA arm actuated by voltage-controlled DC motors is considered. The system has 9 degrees of freedom (6 mechanical and 3 electrical). For the controller only three mechanical degrees of freedom are modeled. It is concluded that the control can efficiently compensate the effect of the unmodeled degrees of freedom, the external interaction, and the inaccuracy of the modeled part of the robot.
We consider array languages (sets of pictures consisting of symbols placed in the lattice points of the 2D grid) and the possibility to handle them with P systems. After proving binary normal forms for array matrix gr...
详细信息
In this paper the issue of strong robustness of sets of systems is introduced and motivated in a scenario of adaptive control. A set of systems is said to be time-invariant strongly robust if the optimal control law d...
详细信息
In this paper the issue of strong robustness of sets of systems is introduced and motivated in a scenario of adaptive control. A set of systems is said to be time-invariant strongly robust if the optimal control law designed on the basis of any element in this set stabilizes any other fixed member of the set. A stronger notion amounts to requiring that time-varying stabilizing control laws designed on the basis of any sequence of elements in the set asymptotically or quadratically stabilizes any other fixed member of the set. In this case, the set of systems is said to be time-varying strongly robust or time-varying strongly quadratically robust. The framework is exhibited for a class of linear and time-invariant SISO systems in discrete-time with fixed order n for a specified class of control objectives. It is established that if a given set of systems satisfies some robustness measures involving the classical structured real or complex radius, then the set is strongly robust. Then, for a more specific class of control objectives, attention is paid to the case of polyhedral sets of systems. A characterization of time-varying strongly quadratically robust sets of systems is given in the form of a feasibility test on a finite set of linear matrix inequalities (LMI's).
We survey and announce some current results on the existence, the viability, and the topological structure of the viable solutions of differential equations and inclusion in Banach spaces under set constraints. Some n...
We survey and announce some current results on the existence, the viability, and the topological structure of the viable solutions of differential equations and inclusion in Banach spaces under set constraints. Some new results concerning semilinear differential inclusions with state variables constrained to the so-called regular and strictly regular sets, together with their applications, are presented and discussed.
The aim of this paper is to work with the measure of nonhyperconvexity in a similar way as J. Cano (1990) does with the index of nonconvexity. We apply this measure to obtain different extensions of the famous Schaude...
The aim of this paper is to work with the measure of nonhyperconvexity in a similar way as J. Cano (1990) does with the index of nonconvexity. We apply this measure to obtain different extensions of the famous Schauder fixed-point theorem in hyperconvex spaces.
This paper proposes a semantic classification of Polish adjectives on the basis of their syntactic features in Polish and English. The aim of the classification is to assure the completeness and the homogeneity of des...
详细信息
This paper proposes a semantic classification of Polish adjectives on the basis of their syntactic features in Polish and English. The aim of the classification is to assure the completeness and the homogeneity of descriptions of the entries in bilingual dictionaries designed for Machine Translation. The classification should prove helpful in assigning descriptions to adjectives in larger dictionaries than that discussed in the paper.
The boom of electronic commerce requires existence and use of reliable means of authentication of communicating parties. We need an analogy of hand-written signature that can be applied to electronic documents. We sha...
详细信息
The boom of electronic commerce requires existence and use of reliable means of authentication of communicating parties. We need an analogy of hand-written signature that can be applied to electronic documents. We shall call such a concept an electronic signature. There is a current trend to make electronic signatures meeting some requirements equal to hand-written signatures. This makes it a very powerful tool but, on the other hand, there are some sensitive security issues that have to be discussed and that the potential users should be aware of. In this article we would like to point out some of these issues and especially those that all electronic signature users are affected by. We have to say, it is very unwise to use a software only implementation on a non-dedicated hardware to create electronic signatures if the responsibility for such signature is not limited. Using a hardware cryptographic module that is incapable of displaying the data to be signed may still be unsatisfac.ory. Using a module without an independent input for authorization data does not help much, a module with an independent input is significantly better but the danger is still far from negligible. Using a dedicated system to create electronic signatures can solve many of the problems. On the other hand, it is the most expensive solution considered. We will describe a solution that is both relatively cheap and reasonably secure. We also suggest some affordable key management solutions.
In this paper we will find the solution of Ãx˜ = b˜, where the elements in à are symmetrical triangular fuzzy numbers (STFN) or crisp numbers and the elements of b˜ are STFN. A method for obtaining the solut...
详细信息
ISBN:
(纸本)9608052629
In this paper we will find the solution of Ãx˜ = b˜, where the elements in à are symmetrical triangular fuzzy numbers (STFN) or crisp numbers and the elements of b˜ are STFN. A method for obtaining the solution is proposed. Examples are presented to clear the idea.
暂无评论