Mikhail Suchkov’s research while affiliated with Kazakh-British Technical University and other places

This paper explores a game-theoretic model for task allocation in distributed systems, where processors with varying speeds and external load factors are considered strategic players. The goal is to understand the impact of processors' strategic behaviors on workload management and overall system efficiency, focusing on the attainment of a pure strategy Nash Equilibrium (NE). The research rigorously develops a formal mathematical model and validates it through extensive simulations, highlighting how NE ensures stability but may not always yield optimal system performance. The adaptive algorithms for dynamic task allocation are proposed to enhance efficiency in real-time processing environments. Results demonstrate that while NE provides stability, the adoption of optimal cooperative strategies significantly improves operational efficiency and reduces transaction costs. The findings contribute valuable insights into the strategic interactions within computational frameworks, offering guidelines for developing more efficient systems. This study not only advances the theoretical understanding of strategic task allocation but also has practical implications for system design and policy-making in areas such as cloud computing and traffic management.

This paper explores the essential dynamics of social networks, specifically examining the phenomenon of information confrontation among users. The goal of the research is the development of a novel simulation methodology that integrates game-theoretic principles with probabilistic techniques to provide a robust model for these interactions. The theoretical framework of the study is founded on the conceptualization of user conflicts as a strategic game between two players. The primary objective for each player in this game is to exert influence and control over as many nodes within the network as possible. To capture the essence of these strategic interactions, we have introduced an innovative algorithm that facilitates dynamic strategy adaptation. This algorithm is pivotal in allowing players to modify their decision-making processes in real-time, based on the continually changing conditions of the network. For practical implementation and validation of the methodology, we used the Facebook Researcher open dataset, with a particular focus on its Kazakhstani segment. This dataset provides a rich source of empirical data, reflecting diverse user interactions and network configurations, which are essential for testing the model. This approach stands out by offering significant improvements in computational efficiency and resource management. By dynamically tracking and updating the network's status, the proposed method reduces the computational resources required, thereby enhancing the scalability of the simulation. In comparing our methodology with other existing models in the field, it becomes evident that it not only matches but in several respects surpasses these methodologies in terms of flexibility. This study makes substantial contributions to the field of social network analysis by providing a sophisticated tool that can be effectively employed to navigate and analyze the complexities of information confrontation in digital social spaces.