Seminaire LIA: Theory and Applications of Matching Games

04 mai: permanent Reseaux, Rachid El-Azouzi

Titre : Theory and Applications of Matching Games

Abstract : In this work,  we study  the link between some network problems and the game-theoretic analysis of two-sided markets.  Particularly, we tackle four network problems using the theory of stable matchings. For this talk I will focus more on the WiFi connectivity management problem.  In particular, we  present a novel AP association mechanism in multi-rate IEEE 802.11 WLANs. We have formulated the problem as a coalition matching game with complementarities and peer effects and we have provided a new practical control mechanism that provides nodes the incentive to form coalitions both solving the unemployment problem and reducing the impact of the anomaly in IEEE 802.11. Simulation results have shown that the proposed mechanism can provide significant gains in terms of increased throughput by minimizing the impact of the anomaly through the overlapping between APs. We have also proposed a polynomial complexity algorithm for computing a stable structure in many-to-one matching games with complementarities and peer effects. This work is a first step in the field of controlled coalition games for achieving core stable associations in distributed wireless networks. Further works includes for example the study of a dynamic number of users or the impact of interference.

Jeudi, 4 Mai, 2017 - 11:30 to 12:30

Laboratoire Informatique d'Avignon

Université d'Avignon et des Pays de Vaucluse
339 chemin des Meinajaries, Agroparc BP 91228, 84911 Avignon cedex 9
+33 (0)4 90 84 35 00