Next Article in Journal
Trailing-Edge Flap Control for Mitigating Rotor Power Fluctuations of a Large-Scale Offshore Floating Wind Turbine under the Turbulent Wind Condition
Next Article in Special Issue
From Nash Equilibria to Chain Recurrent Sets: An Algorithmic Solution Concept for Game Theory
Previous Article in Journal
Study on Mutual Information and Fractal Dimension-Based Unsupervised Feature Parameters Selection: Application in UAVs
Previous Article in Special Issue
A Game-Theoretic Approach to Information-Flow Control via Protocol Composition
Article Menu
Issue 9 (September) cover image

Export Article

Open AccessArticle
Entropy 2018, 20(9), 675;

Optimal Channel Design: A Game Theoretical Analysis

School of Electronic Engineering and Computer Science, Queen Mary University of London, Mile End Road, London E1 4NS, UK
These authors contributed equally to this work.
Authors to whom correspondence should be addressed.
Received: 22 August 2018 / Revised: 31 August 2018 / Accepted: 3 September 2018 / Published: 5 September 2018
(This article belongs to the Special Issue Information Theory in Game Theory)
Full-Text   |   PDF [367 KB, uploaded 6 September 2018]   |  


This 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
Keywords: entropy; game theory; convex optimisation; quantitative information flow entropy; game theory; convex optimisation; quantitative information flow

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Khouzani, M.; Malacaria, P. Optimal Channel Design: A Game Theoretical Analysis. Entropy 2018, 20, 675.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top