Closed form solutions for symmetric water filling games
Eitan Altman (INRIA Sophia Antipolis), Konstantin Avrachenkov (INRIA, Sophia Antipolis), Andrey Garnaev

TL;DR
This paper derives closed form solutions for water-filling problems and Nash equilibria in symmetric Gaussian interference games, enabling efficient computation and analysis of resource allocation in communication networks.
Contribution
It provides the first closed form solutions for water-filling and Nash equilibrium in symmetric interference games, simplifying analysis and computation.
Findings
Closed form solution for water-filling problem.
Explicit Nash equilibrium for symmetric Gaussian interference game.
Improved convergence analysis of iterative water-filling algorithms.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEnergy Harvesting in Wireless Networks · Game Theory and Applications · Advanced Bandit Algorithms Research
