A Distributed Algorithm for Large-Scale Linearly Coupled Resource Allocation Problems with Selfish Agents
Open Access
- 15 July 2021
- journal article
- research article
- Published by Wiley in Scientific Programming
- Vol. 2021, 1-12
Abstract
A decentralized randomized coordinate descent method is proposed to solve a large-scale linearly constrained, separable resource optimization problem with selfish agent. This method has a cheap computational cost and can guarantee an improvement of selected objective function without jeopardizing the others in each iteration. The convergence rate is obtained using an alternative gap benchmark of objective value. Numerical simulations suggest that the algorithm will converge to a random point on the Pareto front.Keywords
Funding Information
- National Natural Science Foundation of China (71971132, 61573244)
This publication has 25 references indexed in Scilit:
- Distributed initialization-free algorithms for multi-agent optimization problems with coupled inequality constraintsNeurocomputing, 2020
- Distributed Optimization for ControlAnnual Review of Control, Robotics, and Autonomous Systems, 2018
- A Survey of Distributed Optimization and Control Algorithms for Electric Power SystemsIEEE Transactions on Smart Grid, 2017
- Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systemsAutomatica, 2016
- Convergence Rate of Distributed Averaging Dynamics and Optimization in NetworksFoundations and Trends® in Systems and Control, 2015
- An Overview of Recent Progress in the Study of Distributed Multi-Agent CoordinationIEEE Transactions on Industrial Informatics, 2012
- Unreeling netflix: Understanding and improving multi-CDN movie delivery2012
- Dynamic Adaptive Streaming over HTTP from Multiple Content Distribution Servers2011
- Optimizing cost and performance for multihomingACM SIGCOMM Computer Communication Review, 2004
- Dynamic parallel access to replicated content in the InternetIEEE/ACM Transactions on Networking, 2002