Dynamic signaling games with quadratic criteria under Nash and Stackelberg equilibria

Creative Commons License

Saritas S., Yuksel S., Gezici S.

AUTOMATICA, cilt.115, 2020 (SCI-Expanded) identifier identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 115
  • Basım Tarihi: 2020
  • Doi Numarası: 10.1016/j.automatica.2020.108883
  • Dergi Adı: AUTOMATICA
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, PASCAL, Applied Science & Technology Source, Aqualine, Communication Abstracts, Compendex, Computer & Applied Sciences, Information Science and Technology Abstracts, INSPEC, MathSciNet, zbMATH, DIALNET, Library, Information Science & Technology Abstracts (LISTA)
  • Anahtar Kelimeler: Signaling games, Stochastic networked control, Game theory, Information theory, INFORMATION, COMMUNICATION, DESIGN
  • Orta Doğu Teknik Üniversitesi Adresli: Hayır

Özet

This paper considers dynamic (multi-stage) signaling games involving an encoder and a decoder who have subjective models on the cost functions. We consider both Nash (simultaneous-move) and Stackelberg (leader-follower) equilibria of dynamic signaling games under quadratic criteria. For the multi-stage scalar cheap talk, we show that the final stage equilibrium is always quantized and under further conditions the equilibria for all time stages must be quantized. In contrast, the Stackelberg equilibria are always fully revealing. In the multi-stage signaling game where the transmission of a Gauss-Markov source over a memoryless Gaussian channel is considered, affine policies constitute an invariant subspace under best response maps for Nash equilibria; whereas the Stackelberg equilibria always admit linear policies for scalar sources but such policies may be nonlinear for multi-dimensional sources. We obtain an explicit recursion for optimal linear encoding policies for multi-dimensional sources, and derive conditions under which Stackelberg equilibria are informative. (C) 2020 Elsevier Ltd. All rights reserved.