Distributed resource allocation on dynamic networks in quadratic time
From MaRDI portal
(Redirected from Publication:503828)
Abstract: We consider the problem of allocating a fixed amount of resource among nodes in a network when each node suffers a cost which is a convex function of the amount of resource allocated to it. We propose a new deterministic and distributed protocol for this problem. Our main result is that the associated convergence time for the global objective scales quadratically in the number of nodes on any sequence of time-varying undirected graphs satisfying a long-term connectivity condition.
Recommendations
- Distributed Continuous-Time Algorithms for Optimal Resource Allocation With Time-Varying Quadratic Cost Functions
- A class of dynamic problems of optimal resource distribution on networks
- A Distributed Algorithm for Resource Allocation Over Dynamic Digraphs
- Distributed Resource Allocation Over Dynamic Networks With Uncertainty
- Dynamic problems of optimal distribution of several kinds of resources on network schedules
- scientific article; zbMATH DE number 4135737
- Distributed resource allocation over random networks based on stochastic approximation
- On optimal management of resources in distributed networks
- Algorithm for optimal distribution of discrete nonuniform resources on a network
- Distributed resource allocation via multi-agent systems under time-varying networks
Cites work
- scientific article; zbMATH DE number 3713496 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- Decentralized Resource Allocation in Dynamic Networks of Agents
- Distributed Generator Coordination for Initialization and Anytime Optimization in Economic Dispatch
- Initialization-free distributed coordination for economic dispatch under varying loads and generator commitment
- On Distributed Averaging Algorithms and Quantization Effects
- Optimal scaling of a gradient method for distributed resource allocation
- Random Coordinate Descent Algorithms for Multi-Agent Convex Optimization Over Networks
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
Cited in
(13)- A distributed ADMM-like method for resource sharing over time-varying networks
- Distributed delay-tolerant strategies for equality-constraint sum-preserving resource allocation
- Distributed constrained optimization for multi-agent networks with nonsmooth objective functions
- Algorithm for optimal distribution of discrete nonuniform resources on a network
- Optimal scaling of a gradient method for distributed resource allocation
- A distributed extremum seeking based resource allocation algorithm over switching networks
- Price-based protocols for fair resource allocation, convergence time analysis and extension to Leontief utilities
- Decentralized Resource Allocation in Dynamic Networks of Agents
- Distributed resource coordination in networked systems described by digraphs
- Design and implementation of distributed resource management for time-sensitive applications
- Distributed optimal in-network resource allocation algorithm design via a control theoretic approach
- A dual approach for optimal algorithms in distributed optimization over networks
- Distributed optimal resource allocation over strongly connected digraphs: a surplus-based approach
This page was built for publication: Distributed resource allocation on dynamic networks in quadratic time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q503828)
