The Algorithm to Select Security Classes for Objects in Distributed Information Systems and Place Data in the Objects Through Reducing the Optimization Problem to the Theory of Games with Non-conflicting Interests
<p>Modern methods to solve the practical problems related to the information security system design in multipurpose distributed systems often use optimization models. The paper formulates a problem statement of bilinear Boolean programming with the quality score that determines the level of th...
Main Authors: | A. Yu. Bykov, F. A. Panfilov, A. V. Hovrina |
---|---|
Format: | Article |
Language: | Russian |
Published: |
MGTU im. N.È. Baumana
2016-01-01
|
Series: | Nauka i Obrazovanie |
Subjects: | |
Online Access: | http://technomag.edu.ru/jour/article/view/76 |
Similar Items
-
Successful Nash Equilibrium Agent for a Three-Player Imperfect-Information Game
by: Sam Ganzfried, et al.
Published: (2018-06-01) -
On the exact polynomial time algorithm for a special class of bimatrix game
by: Jonas Mockus, et al.
Published: (2013-12-01) -
On Correlated Equilibria in Marinatto–Weber Type Quantum Games
by: Piotr Frąckiewicz
Published: (2020-12-01) -
Development and analysis of game-theoretical models of security systems agents interaction
by: Serhii Yevseiev, et al.
Published: (2020-04-01) -
The Monty Hall Problem as a Bayesian Game
by: Mark Whitmeyer
Published: (2017-07-01)