Papers by Oleksii Ignatenko
Cybernetics and Systems Analysis, Jul 1, 2013
This paper deals with conflict control models of dataflows on the Internet. The problem is consid... more This paper deals with conflict control models of dataflows on the Internet. The problem is considered, its urgency is emphasized, and current approaches to solving it are described. For networks with varying dataflows and conflicting users (denial-of-service attacks), a new approach to the analysis based on conflict-control models is proposed. A control model for a class of networks with a fixed window is developed and the existence of a time-optimal solution is shown. Data loss conditions are established and the system stability against some types of attacks is found.
Game-theoretic approach to the network security problem
Problemy programmirovaniâ, 2017
Game-Theoretical Model of Users Interaction in Computer Networks
Journal of Automation and Information Sciences, 2017
PROBLEMS IN PROGRAMMING, 2020
Current situation with official documentary in the world, and especially in Ukraine, requires too... more Current situation with official documentary in the world, and especially in Ukraine, requires tools for electronical processing. One of the main tasks at this field is seal (or stamp) detection, which leads to documents classification based on mentioned criterion. Current article analyzes some of existed methods to resolve the problem, describes a new approach to classify documentary and reflects dependence of model accuracy to input data amount. As a result of this work is a convolutional neural network that classify 708 out of 804 images of official documents correctly. A corresponded percentage of model accuracy is 88.03, despite the fact of bias presence in input data.
PROBLEMS IN PROGRAMMING, 2018
В даній роботі досліджується ігрова модель взаємодії користувачів, що виконують паралельні обчисл... more В даній роботі досліджується ігрова модель взаємодії користувачів, що виконують паралельні обчислення у гетерогенній багатопроцесорній системі. На прикладі задачі множення матриць побудований підхід до потокового моделювання процесів планування. Пропонується ігрова модель взаємодії, де стратегіями є вибір блоку розрізання матриці. Знайдені оцінки стану рівноваги та проведені експерименти, що підтверджують теоретично отримані результати. Побудована імітаційна модель, яка демонструє точки рівноваги Неша у грі взаємодії користувачів. Ключові слова: паралельні обчислення, теорія ігор, рівновага Неша, імітаційна модель. В работе исследуется игровая модель взаимодействия пользователей, выполняющих параллельные вычисления в гетерогенной многопроцессорной системе. Предложенный поход применяется к задаче умножения матриц с использованием планировщика мин-мин. Действием пользователей в этом случае является размер блоков, на которые разрезается матрица. Экспериментально полученные характеристики системы были использованы для настройки имитационной модели, что позволило измерить оценку времени завершения работы для всех возможных комбинаций разбиения задач по процессорам и построить поверхность времени окончания работы для каждого пользователя. Полученные результаты были обоснованы и обобщены на основе игрового подхода, в частности показано существования точки равновесия Неша в игре взаимодействия двух пользователей и найдены условия ее Парето неэффективности. Ключевые слова: параллельные вычисления, теория игр, потоковая модель, равновесие Неша, имитационная модель. This paper deals with a game model of users performing parallel computing in a heterogeneous multiprocessor system. The proposed approach is applied to the problem of matrix multiplication on the system with the scheduler of min-min type. The user's action is to choose the size of the blocks into which the matrix is cut. Each user tries to optimize own finish time, which leads to conflict. Using the game theoretic approach, we build game model and found the conditions of Nash equilibrium existence in the scheduling game of two users. Simulation program was built to provide experimental data.
A Problem of Evasion of Two Controlled Objects from a Group of Pursuers in the Three-Dimensional Space
Journal of Automation and Information Sciences, 2002
How Concept Learning Changes Strategic Choice in Guessing Games?
Proceedings of the 2nd Myroslav I. Zhaldak Symposium on Advances in Educational Technology
Educational Dimension
This paper is about people's strategic behavior as observed through experiments. The research... more This paper is about people's strategic behavior as observed through experiments. The research question posed in this paper is how players (primarily children) learn in complex strategic situations that they have never encountered before. We examine data from various games played during popular game theory lectures and present findings about players' strategic learning progress while competing with other players. Four ``pick a number'' games with similar-looking rules but very different properties were investigated. These games were presented to various groups of listeners. The collected data is available for replication and analysis in an open repository. In this paper, we analyze data and propose an agent-based model of a beauty pageant game to explain observed behavior. Finally, we discuss the findings, hypotheses to test, and open questions for future research.
This paper deals with strategic behavior of people, we observed from experiments. The research qu... more This paper deals with strategic behavior of people, we observed from experiments. The research question, formulated in this work, is how players (mainly children) learn in complex strategic situations which they never faced before. We examine data from different games, played during popular lectures about game theory and present findings about players progress in strategic learning while competing with other players. Four “pick a number” games were investigated, all with similar-looking rules but very different properties. These games were introduced to very different groups of listeners. The data gathered is available in open repository for replication and analysis. In the work we analyse data and propose the agent-based model of beauty contest game, explaining observed behavior. Finally, we discuss the findings propose hypothesis to investigate and formulate open questions for future research.
A two player network differential game with window-based control and losses
Abstract. In developing the network management systems often encountered a situation where there ... more Abstract. In developing the network management systems often encountered a situation where there is a need to deal with malicious intrusion attempts aimed at obstructing the work. In this case, methods of management based on fluid models and a discrete controlled random walk model requires certain changes. In this work a generalization of the usual models of single server queue which can describe the attacking action and behaviour of the system of protection is presented. Formulation and analysis of the problem are proposed. There are conditions found under which the game can be finished.
PROBLEMS IN PROGRAMMING, 2016
This paper deals with modeling of network’s dynamic using game theory approach. The process of in... more This paper deals with modeling of network’s dynamic using game theory approach. The process of interaction among players (network users), trying to maximize their payoffs (e.g. throughput) could be analyzed using game-based concepts (Nash equilibrium, Pareto efficiency, evolution stability etc.). In this work we presented the model of TCP network’s dynamic and proved existence and uniqueness of solution, formulated payoff matrix for a network game and found conditions of equilibrium existence depending of loss sensitivity parameter. We consider influence if denial of service attacks on the equilibrium characteristics and illustrate results by simulations.
This paper deals with modeling of network’s dynamic using game theory approach. The process of in... more This paper deals with modeling of network’s dynamic using game theory approach. The process of interaction among players (network users), trying to maximize their payoffs (e.g. throughput) could be analyzed using gamebased concepts (Nash equilibrium, Pareto efficiency, evolution stability etc.). In this work we presented the model of TCP network’s dynamic and proved existence and uniqueness of solution, formulated payoff matrix for a network game and found conditions of equilibrium existence depending of loss sensitivity parameter. We consider influence if denial of service attacks on the equilibrium characteristics and illustrate results by simulations.
PROBLEMS IN PROGRAMMING, 2016
Competitive development of various versions of network protocols is an essential part of computer... more Competitive development of various versions of network protocols is an essential part of computer networks. The most-used protocol today is Transmission Control Protocol (TCP). There is a large number of implementations of the TCP protocol, which differ by mechanism of congestion control. TCP develops by improving its existent implementations, vanishing some of them and via creation of a new ones. The possibility of using new versions of the protocol allows the user to increase the data rate by selecting the appropriate implementation of TCP. It is difficult to predict consequences of computer network users’ interaction in situations when many users try to achieve higher data rate by applying different TCP implementation. The actual task is to develop a theoretical and program tools to model such competitive dynamic interactions. This is the goal of my scientific-research work. Game theory, which is the theory of mathematical models of optimal decision making in situations of confli...
Communications in Computer and Information Science, 2014
This paper deals with modeling of network's dynamic using evolutionary games approach. Today ther... more This paper deals with modeling of network's dynamic using evolutionary games approach. Today there are many different protocols for data transmission through Internet, providing users with better or worse service. The process of choosing better protocol could be considered as a dynamic game with players (users), trying to maximize their payoffs (e.g. throughput). In this work we presented the model of network's dynamic using differential equations with discontinuous right side and proved existence and uniqueness of solution, formulated payoff matrix for a network game and found conditions of equilibrium existence depending of loss sensitivity parameter. The results are illustrated by simulations.
This paper deals with denial of service attack. Overview of the existing attacks and methods is p... more This paper deals with denial of service attack. Overview of the existing attacks and methods is proposed. Classification scheme is presented for a different denial of service attacks. There is considered agent-based intrusion detection systems architecture. Considered main components and working principles for a systems of such kind.
: Game theoretical techniques have recently become prevalent in many engineering applications, no... more : Game theoretical techniques have recently become prevalent in many engineering applications, notably in communications. While developing an information network management system often encountered a situation where one should deal with malicious intrusion attempts aimed at obstructing the routing policy work. In this case, methods of networks management based on fluid models and a discrete controlled random walk model requires certain changes. In this work we propose an approach based on conflict control point of view that could be useful for modeling of attacking actions and response behaviour of the system.
This paper deals with network congestion problems using evolutionary games approach. Today there ... more This paper deals with network congestion problems using evolutionary games approach. Today there are many protocols various network layers. Different versions of protocols compete for Internet resources. The process of the upgrading of existing protocols, abandonment of some protocols and appearance of new ones could be considered as evolution of game of special type. In this game network connections choose between aggressive and peaceful strategies trying to maximize their payoffs. We present conditions of equilibrium existence depending of loss sensitivity parameter. This result is illustrated by simulation of game dynamic.
The focus of this work is to provide introduction to the current state of art of the field of spr... more The focus of this work is to provide introduction to the current state of art of the field of spreading processes on networks in connection with optimal control theory and game theory. This is challenging problem which remains open, so we present problem formulation, make suggestion of possible ideas of solution and show simulations to substantiate these ideas.
This paper deals with modeling of network’s dynamic using game theory approach. The process of in... more This paper deals with modeling of network’s dynamic using game theory approach. The process of interaction among players (network users), trying to maximize their payoffs (e.g. throughput) could be analyzed using game-based concepts (Nash equilibrium, Pareto efficiency, evolution stability etc). In this work we presented the model of TCP network’s dynamic and proved existence and uniqueness of solution, formulated payoff matrix for a network game and found conditions of equilibrium existence depending of loss sensitivity parameter. We consider influence if denial of service attacks on the equilibrium characteristics and illustrate results by simulations. 1.0 INTRODUCTION It is almost impossible now to imagine our life without computer networks. Only for several decades, the Internet has rapidly transformed the ways in which individuals, societies and even governments communicate, exchange information and conduct their economic and social activities. And this process is far from the ...
Uploads
Papers by Oleksii Ignatenko