.png){kind=icon}
返回
Decentralized online integer programming problems with a coupling cardinality constraint
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2021.105421.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider a problem involving a set of agents who need to coordinate their actions to optimize the sum of their objectives while satisfying a common resource constraint. The objective functions of the agents are unknown to them a priori and are revealed in an online manner. The resulting problem is an online optimization problem to optimally allocate the resource among the agents prior to observing the objective functions. For any deterministic online algorithm for this problem, it has been shown that there exists a lower bound of Omega(T) on regret. When the agents' integer programs satisfy a discrete concavity condition, we propose a randomized online algorithm that is decentralized and guarantees an upper bound of O(K root T ln m) on the expected regret, where K is the total amount of resource to be shared and m is the number of agents.
Keyword:
Decentralized optimization
Online optimization
Distributed integer programming
Resource allocation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W