Completely Uncoupled Algorithms for Network Utility Maximization

by   S. Ramakrishnan, et al.

In this paper, we present two completely uncoupled algorithms for utility maximization. In the first part, we present an algorithm that can be applied for general non-concave utilities. We show that this algorithm induces a perturbed (by ϵ) Markov chain, whose stochastically stable states are the set of actions that maximize the sum utility. In the second part, we present an approximate sub-gradient algorithm for concave utilities which is considerably faster and requires lesser memory. We study the performance of the sub-gradient algorithm for decreasing and fixed step sizes. We show that, for decreasing step sizes, the Cesaro averages of the utilities converges to a neighbourhood of the optimal sum utility. For constant step size, we show that the time average utility converges to a neighbourhood of the optimal sum utility. Our main contribution is the expansion of the achievable rate region, which has been not considered in the prior literature on completely uncoupled algorithms for utility maximization. This expansion aids in allocating a fair share of resources to the nodes which is important in applications like channel selection, user association and power control.


page 1

page 2

page 3

page 4


Network Utility Maximization with Unknown Utility Functions: A Distributed, Data-Driven Bilevel Optimization Approach

Fair resource allocation is one of the most important topics in communic...

A Constant Step Stochastic Douglas-Rachford Algorithm with Application to Non Separable Regularizations

The Douglas Rachford algorithm is an algorithm that converges to a minim...

A refined consumer behavior model for energy systems: Application to the pricing and energy-efficiency problems

The sum-utility maximization problem is known to be important in the ene...

Online Revenue Maximization with Unknown Concave Utilities

We study an online revenue maximization problem where the consumers arri...

Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Non-Convex Optimization

Backtracking line-search is an old yet powerful strategy for finding bet...

A Monetary Mechanism for Stabilizing Cooperative Data Exchange with Selfish Users

This paper considers the problem of stabilizing cooperative data exchang...

Improving Sparse Associative Memories by Escaping from Bogus Fixed Points

The Gripon-Berrou neural network (GBNN) is a recently invented recurrent...

Please sign up or login with your details

Forgot password? Click here to reset