Optimal Hierarchical Signaling for Quadratic Cost Measures and General Distributions: A Copositive Program Characterization

In this paper, we address the problem of optimal hierarchical signaling between a sender and a receiver for a general class of square integrable multivariate distributions. The receiver seeks to learn a certain information of interest that is known to the sender while the sender seeks to induce the receiver to perceive that information as a certain private information. For the setting where the players have quadratic cost measures, we analyze the Stackelberg equilibrium, where the sender leads the game by committing his/her strategies beforehand. We show that when the underlying state space is "finite", the optimal signaling strategies can be computed through an equivalent linear optimization problem over the cone of completely positive matrices. The equivalence established enables us to use the existing computational tools to solve this class of cone programs approximately with any error rate. For continuous distributions, we also analyze the error of approximation, if the optimal signaling strategy is computed for a discretized version obtained through a quantization scheme, and we provide an upper bound in terms of the quantization error.

[1]  Sinan Gezici,et al.  Quadratic Multi-Dimensional Signaling Games and Affine Equilibria , 2015, IEEE Transactions on Automatic Control.

[2]  Emir Kamenica,et al.  Bayesian Persuasion and Information Design , 2019, Annual Review of Economics.

[3]  Emir Kamenica,et al.  A Rothschild-Stiglitz Approach to Bayesian Persuasion , 2016 .

[4]  Soummya Kar,et al.  Gossip Algorithms for Distributed Signal Processing , 2010, Proceedings of the IEEE.

[5]  Farhad Farokhi,et al.  Estimation With Strategic Sensors , 2014, IEEE Transactions on Automatic Control.

[6]  P. Parrilo Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization , 2000 .

[7]  Ting Kei Pong,et al.  Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices , 2018, J. Glob. Optim..

[8]  J. Sobel,et al.  STRATEGIC INFORMATION TRANSMISSION , 1982 .

[9]  Mirjam Dür,et al.  Linear-Time Complete Positivity Detection and Decomposition of Sparse Matrices , 2012, SIAM J. Matrix Anal. Appl..

[10]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[11]  Tamer Basar,et al.  Deception-As-Defense Framework for Cyber-Physical Systems , 2019, ArXiv.

[12]  Haifeng Xu,et al.  Algorithmic Bayesian persuasion , 2015, STOC.

[13]  Peter J. C. Dickinson AN IMPROVED CHARACTERISATION OF THE INTERIOR OF THE COMPLETELY POSITIVE CONE , 2010 .

[14]  E. Alper Yildirim,et al.  On the accuracy of uniform polyhedral approximations of the copositive cone , 2012, Optim. Methods Softw..

[15]  Tamer Başar,et al.  Hierarchical multistage Gaussian signaling games in noncooperative communication and control systems , 2016, Autom..

[16]  Mirjam Dür,et al.  An Adaptive Linear Approximation Algorithm for Copositive Programs , 2009, SIAM J. Optim..

[17]  Mirjam Dür,et al.  Open problems in the theory of completely positive and copositive matrices , 2015 .

[18]  Emir Kamenica,et al.  Bayesian Persuasion , 2009, World Scientific Series in Economic Theory.

[19]  Tamer Basar,et al.  Robust Sensor Design Against Multiple Attackers with Misaligned Control Objectives , 2019, ArXiv.

[20]  A. Kolotilin Optimal Information Disclosure: A Linear Programming Approach , 2016 .

[21]  Tamer Başar,et al.  Information-Theoretic Approach to Strategic Communication as a Hierarchical Game , 2015, Proceedings of the IEEE.

[22]  E. Alper Yildirim Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis , 2017, Optim. Methods Softw..

[23]  W. Tamura A Theory of Multidimensional Information Disclosure , 2014 .

[24]  Piotr Dworczak,et al.  The Simple Economics of Optimal Persuasion , 2017, Journal of Political Economy.

[25]  David L. Neuhoff,et al.  Quantization , 2022, IEEE Trans. Inf. Theory.

[26]  Henryk Minc,et al.  On the Matrix Equation X′X = A , 1962, Proceedings of the Edinburgh Mathematical Society.

[27]  Mirjam Dür,et al.  A factorization method for completely positive matrices , 2020 .

[28]  Shaddin Dughmi,et al.  Algorithmic information structure design: a survey , 2017, SECO.

[29]  Immanuel M. Bomze,et al.  The structure of completely positive matrices according to their CP-rank and CP-plus-rank , 2015 .

[30]  F. Tardella On the existence of polyhedral convex envelopes , 2004 .