fuzzy relation inequalities based on max-f composition are discussed, where f is a binary aggregation on [0,1]. for a fixed fuzzy relation inequalities system $ a circ^{f}textbf{x}leqtextbf{b}$, we characterize all matrices $ a^{'} $ for which the solution set of the system $ a^{' } circ^{f}textbf{x}leqtextbf{b}$ is the same as the original solution set. similarly, for a fixed matrix ...

in this article we consider the averaging method for differential inclusions with fuzzy right-hand side for the case when the limit of a method of an average does not exist.

We establish a link between von Neumann–Morgenstern stable set and the Nash solution in a general n-player utility set. The stable set-solution is defined with respect to a dominance relation: payoff vector u dominates v if one player prefers u even with one period delay. We show that a stable set exists and, if the utility set has a smooth surface, any stable set converges to the Nash bargaini...

We establish a general n-player link between non-cooperative bargaining and the Nash solution. Non-cooperative bargaining is captured in a reduced form through the von Neumann-Morgenstern (1944) stability concept. A stable set always exists. Moreover, if the utility set has a smooth surface, then any stable set converges to the Nash bargaining solution. Finally, the equivalence of stationary eq...

Self-propelled particle (SPP) models are often compared with animal swarms. However, the collective animal behaviour observed in experiments often leaves considerable unconstrained freedom in the structure of a proposed model. Essentially, multiple models can describe the observed behaviour of animal swarms in simple environments. To tackle this degeneracy, we study swarms of SPPs in non-trivia...