.png){kind=icon}
返回
Completely Uncoupled Algorithms for Network Utility Maximization
.png){kind=icon}
OA
AI
DOI：10.1109/TNET.2019.2892801.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 epsilon) 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 neighborhood of the optimal sum utility. For constant step size, we show that the time average utility converges to a neighborhood of the optimal sum utility. Our main contribution is the expansion of the achievable rate region, which has not been considered in the previous paper 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.
Keyword:
Distributed resource allocation
learning in games
utility maximization and fairness
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.6
论文数:
4.4K
被引数:
9.5K
机构
引用论文
.png){kind=icon}
Effect of modified Taohongsiwu decoction on patients with chemotherapy-induced hand-foot syndromeOAAI
OAAI分享收藏Distributed CSMA Algorithms for Link Scheduling in Multihop MIMO Networks Under SINR ModelSINR模型下多跳MIMO网络链路调度的分布式CSMA算法OAAI
OAAI分享收藏
查看更多内容