# Distributed Resource Allocation on Dynamic Networks in Quadratic Time

arXiv: https://arxiv.org/abs/1507.07850 · HTML: https://mlsanity.com/paper/1507.07850/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 28 Jul 2015.

## Built on by (most cited first, 2 of 2)

- [Discretized Distributed Optimization over Dynamic Digraphs](https://mlsanity.com/paper/2311.07939/) (2023)
- [Distributed Finite-Sum Constrained Optimization subject to Nonlinearity on the Node Dynamics](https://mlsanity.com/paper/2203.14527/) (2022)

## Abstract (arXiv)

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.