Development and Application of Information Theoretical Bounds to Certain Class of Coordination Problems

Thesis defended on June 14, 2016, 2:00 PM at CentraleSupelec (Gif-sur-Yvette) Amphi F3-06

With the rise in connectivity between appliances (Internet of Things), new avenues for coordination between various entities have opened up. At the same time, recent information theoretical results have provided bounds for the performance that any coordination scheme could achieve under certain information structures. In this thesis, we further develop those information theoretical results with the aim of making them applicable more easily to practical problems. In this regard, the contribution of this thesis is twofold: 1) Further developing the aforementioned information theoretical results to provide insights into the structure of the solutions to optimization problem posed in them, as well as generalizing some results. 2) Developing algorithms which exploit the theoretical framework provided by Information theory to devise practical, decentralized and robust coordination schemes. The generality of the approach lends itself to various applications, of which the following were treated: power optimization in wireless networks, power consumption scheduling in smart grid applications, as well as

Witsenhausen counterexample, an important toy problem in control theory. Various opportunities still lie ahead to exploit the framework and tools developed herein. Indeed, they could be useful even in domains which have not been explored in this thesis but which require coordination between agents with different information available to each.


M, Assaad, Mohamad Professeur Adjoint, CentraleSupelec Examinateur

M, Chahed, Tijani Professeur, Telecom SudParis Examinateur

M, Gesbert, David Professeur, EURECOM Rapporteur

M, Lasaulce, Samson Directeur de Recherche, CNRS Directeur de thèse

M, Millerioux, Gilles Professeur, Université de Lorraine Examinateur

M, Yezekael, Hayel Maître de Conférences, Université d'Avignon Rapporteur