The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 521 –
540 of
714
Combat Management System training uses simulation of an overall tactical situation. This involves the real-time management of numerous and diverse entities to keep the simulation scenario consistent in a highly dynamic environment. To address this difficult problem, we propose an adaptive multi-agent system in which each entity is considered as a smart sensor/effector mobile. The autonomy and the dynamic behaviour offered to each entity leads the simulation to self-adapt to inevitable disturbances...
The paper investigates the sensitivity of safe ship control to inaccurate data from the ARPA anti-collision radar system and to changes in the process control parameters. The system structure of safe ship control in collision situations and computer support programmes exploring information from the ARPA anti-collision radar are presented. Sensitivity characteristics of the multistage positional non-cooperative and cooperative game and kinematics optimization control algorithms are determined through...
Two games are inseparable by semivalues if both games
obtain the same allocation whatever semivalue is considered. The problem of
separability by semivalues reduces to separability from the null
game. For four or more players, the vector subspace of games
inseparable from the null game by semivalues contains games
different to zero-game. Now, for five or more players, the
consideration of a priori coalition blocks in the player set allows
us to reduce in a significant way the dimension of the vector
subspace...
We investigate the Sandpile Model and Chip Firing Game and an extension of these models on cycle graphs. The extended model consists of allowing a negative number of chips at each vertex. We give the characterization of reachable configurations and of fixed points of each model. At the end, we give explicit formula for the number of their fixed points.
This review paper gives a characterization of non-coalitional zero-sum and non-zero-sum games with finite strategy spaces and payoff functions having some concavity or convexity properties. The characterization is given in terms of the existence of two-point Nash equilibria, that is, equilibria consisting of mixed strategies with spectra consisting of at most two pure strategies. The structure of such simple equilibria is discussed in various cases. In particular, many of the results discussed can...
We propose a generalization of simple coalition games in the context of games with fuzzy coalitions. Mimicking the correspondence of simple games with non-constant monotone formulas of classical logic, we introduce simple Łukasiewicz games using monotone formulas of Łukasiewicz logic, one of the most prominent fuzzy logics. We study the core solution on the class of simple Łukasiewicz games and show that cores of such games are determined by finitely-many linear constraints only. The non-emptiness...
We consider in this article diagonal parabolic systems arising in the context of stochastic differential games. We address the issue of finding smooth solutions of the system. Such a regularity result is extremely important to derive an optimal feedback proving the existence of a Nash point of a certain class of stochastic differential games. Unlike in the case of scalar equation, smoothness of solutions is not achieved in general. A special structure of the nonlinear hamiltonian seems to be the...
We consider in this article diagonal parabolic systems arising in the context of
stochastic differential games.
We address the issue of finding smooth solutions of the system. Such a regularity
result is extremely important to derive an optimal feedback proving the existence
of a Nash point of a certain class of stochastic differential games.
Unlike in the case of scalar equation, smoothness of solutions is not achieved in
general. A special structure of the nonlinear Hamiltonian seems to be...
In this paper, we consider production economies with possibly unequal production skills and with the possibility of technological innovations, in which resource allocations are determined via bargaining among individuals. We define the Nash (resp. the Kalai-Smorodinsky) bargaining solution as the (bargaining) allocation rule whose utility outcomes just result in the Nash (resp. the Kalai-Smorodinsky) bargaining outcomes. Two new axioms regarding compensation for low skill agents are introduced as...
Currently displaying 521 –
540 of
714