Novel Information-Theoretic Game-Theoretical Insights to Broadcasting

Abstract

E.g. for the Internet-of-unmanned aerial vehicles (UAVs) some challenges in broadcasting and from new points of view are explored. In this paper, first, we investigate a single broadcast transceiver. From a control of noisy-channel viewpoint, we consider: (<i>i</i>) Alice sends <inline-formula><tex-math notation="LaTeX">$\mathcal {X}$</tex-math></inline-formula> to Bob as more efficient as possible while she wishes Bob not to get access to the private message <inline-formula><tex-math notation="LaTeX">$\mathcal {S}$</tex-math></inline-formula> regarding the correlation between <inline-formula><tex-math notation="LaTeX">$\mathcal {S}$</tex-math></inline-formula> and <inline-formula><tex-math notation="LaTeX">$\mathcal {X}$</tex-math></inline-formula> &#x2013; i.e., Alice purposefully sends a <i>turbulent-flow</i> of the information to Bob; and (<i>ii</i>) where <inline-formula><tex-math notation="LaTeX">$(\Theta _{1};\Theta _{2})$</tex-math></inline-formula> is the control-action-pair which actualise a <i>pursuit-Evasion</i>. We consider <i>dissipativity</i> in our system due to the memory effect relating to the previous states. We thus propose a federated-learning based <i>Blahut-Arimoto</i> algorithm while a 2-D <i>dissipativity</i>-theoretic continuous-Mean-Field-Game (MFG) is proposed with regard to (w.r.t.) a joint probability-distribution-function (PDF) of the population distribution &#x2013; relating to a continuous-control-law. We also analyse what if Alice is owed to multiple Bobs in a multi-user scenario which we apply a bankruptcy based 3&#x2013;level nested game for.