Closed form solutions for symmetric water filling games

Abstract : We study power control in optimization and game frameworks. In the optimization framework there is a single decision maker who assigns network resources and in the game framework users share the network resources according to Nash equilibrium. The solution of these problems is based on so-called water-filling technique, which in turn uses bisection method for solution of non-linear equations for Lagrange multiplies. Here we provide a closed form solution to the water-filling problem, which allows us to solve it in a finite number of operations. Also, we produce a closed form solution for the Nash equilibrium in symmetric Gaussian interference game with an arbitrary number of users. Even though the game is symmetric, there is an intrinsic hierarchical structure induced by the quantity of the resources available to the users. We use this hierarchical structure to perform a successive reduction of the game. In addition, to its mathematical beauty, the explicit solution allows one to study limiting cases when the crosstalk coefficient is either small or large. We provide an alternative simple proof of the convergence of the Iterative Water Filling Algorithm. Furthermore, it turns out that the convergence of Iterative Water Filling Algorithm slows down when the crosstalk coefficient is large. Using the closed form solution, we can avoid this problem. Finally, we compare the non-cooperative approach with the cooperative approach and show that the non-cooperative approach results in a more fair resource distribution.
Type de document :
Rapport
[Research Report] RR-6254, INRIA. 2007, pp.23
Liste complète des métadonnées

Littérature citée [1 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00165526
Contributeur : Rapport de Recherche Inria <>
Soumis le : lundi 30 juillet 2007 - 14:39:23
Dernière modification le : jeudi 11 janvier 2018 - 16:57:54
Document(s) archivé(s) le : mardi 21 septembre 2010 - 13:42:14

Fichiers

RR-6254.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00165526, version 2
  • ARXIV : 0707.3936

Collections

Citation

Eitan Altman, Konstantin Avrachenkov, Andrey Garnaev. Closed form solutions for symmetric water filling games. [Research Report] RR-6254, INRIA. 2007, pp.23. 〈inria-00165526v2〉

Partager

Métriques

Consultations de la notice

269

Téléchargements de fichiers

104