Communication games with partially soft power constraints (Q1102878)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4051386
Language Label Description Also known as
default for all languages
No label defined
    English
    Communication games with partially soft power constraints
    scientific article; zbMATH DE number 4051386

      Statements

      Communication games with partially soft power constraints (English)
      0 references
      0 references
      0 references
      1989
      0 references
      We consider a class of communication games which involves the transmission of a Gaussian random variable through a conditionally Gaussian memoryless channel in the presence of an intelligent jammer. The jammer is allowed to tap the channel and feed a correlated signal back into it. The transmitter-receiver pair is assumed to cooperate in minimizing some quadratic fidelity criterion while the jammer maximizes this same criterion. Security strategies which protect against irrational jammer behavior and which yield an upper bound on the cost are shown to exist for the transmitter-receiver pair over a class of fidelity criteria. Closed-form expressions for these strategies are provided in the paper, which are in all cases, but one, linear in the available information.
      0 references
      communication games
      0 references
      conditionally Gaussian memoryless channel
      0 references
      intelligent jammer
      0 references
      mixed saddle points
      0 references
      statistical decision theory
      0 references
      nonclassical information patterns
      0 references

      Identifiers