The paper proposes an approach that allows countering attacks on cryptocurrency exchanges and their clients. This is formalized in the form of a synthesis dynamic model resistance to phishing perceptron simplest artificial neural network. dynamics confrontation are determined by system differential equations determines change states victim attacker who organizes such attacks. find optimal strat...

Recently the general Game Description Language (GDL) has been extended so as to cover arbitrary games with incomplete/imperfect information. Learning—without human intervention—to play such games poses a reasoning challenge for general game-playing systems that is much more intricate than in case of complete information games. Action formalisms like the Situation Calculus have been developed fo...

Consider a symmetric 2-player game of complete information. Consider an arbitrary Bayesian extension of that game with payoff-irrelevant types, independent random matching, and anonymity (private types). We show that, in this setting, while strategies in a Bayesian Nash equilibrium of that game can differ across types, aggregate play in any such equilibrium must coincide with a symmetric Nash e...

We present an evolutionary game theoretic approach to study node cooperation behavior in wireless ad hoc networks. Evolutionary game theory (EGT) has been used to study the conditions governing the growth of cooperation behavior in biological and social networks. We propose a model of node cooperation behavior in dynamic wireless networks such as vehicular networks. Our work is motivated by the...

A game of group pursuit in which players move on a plane with bounded velocities is considered. The game is supposed to be a nonzerosum simple pursuit game between an evader and m pursuers acting independent of each other. The case of complete information is studied. In other words, each player, choosing control variables at each time instant t > 0, knows the moment t and his own as well as all...