Optimal Channel Design: A Game Theoretical Analysis
AbstractThis paper studies the problem of optimal channel design. For a given input probability distribution and for hard and soft design constraints, the aim here is to design a (probabilistic) channel whose output leaks minimally from its input. To analyse this problem, general notions of entropy and information leakage are introduced. It can be shown that, for all notions of leakage here defined, the optimal channel design problem can be solved using convex programming with zero duality gap. Subsequently, the optimal channel design problem is studied in a game-theoretical framework: games allow for analysis of optimal strategies of both the defender and the adversary. It is shown that all channel design problems can be studied in this game-theoretical framework, and that the defender’s Bayes–Nash equilibrium strategies are equivalent to the solutions of the convex programming problem. Moreover, the adversary’s equilibrium strategies correspond to a robust inference problem. View Full-Text
Share & Cite This Article
Khouzani, M.; Malacaria, P. Optimal Channel Design: A Game Theoretical Analysis. Entropy 2018, 20, 675.
Khouzani M, Malacaria P. Optimal Channel Design: A Game Theoretical Analysis. Entropy. 2018; 20(9):675.Chicago/Turabian Style
Khouzani, MHR.; Malacaria, Pasquale. 2018. "Optimal Channel Design: A Game Theoretical Analysis." Entropy 20, no. 9: 675.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.