Games based study of nonblind confrontation (Q1993240)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Games based study of nonblind confrontation |
scientific article; zbMATH DE number 6972601
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Games based study of nonblind confrontation |
scientific article; zbMATH DE number 6972601 |
Statements
Games based study of nonblind confrontation (English)
0 references
5 November 2018
0 references
Summary: Security confrontation is the second cornerstone of the General Theory of Security. And it can be divided into two categories: blind confrontation and nonblind confrontation between attackers and defenders. In this paper, we study the nonblind confrontation by some well-known games. We show the probability of winning and losing between the attackers and defenders from the perspective of channel capacity. We establish channel models and find that the attacker or the defender wining one time is equivalent to one bit transmitted successfully in the channel. This paper also gives unified solutions for all the nonblind confrontations.
0 references
0.7689128
0 references
0 references