Distributed resource allocation on dynamic networks in quadratic time

From MaRDI portal
Publication:503828

DOI10.1016/J.SYSCONLE.2016.11.006zbMATH Open1353.93012arXiv1507.07850OpenAlexW2963250913MaRDI QIDQ503828FDOQ503828


Authors: Thinh T. Doan, Alex Olshevsky Edit this on Wikidata


Publication date: 23 January 2017

Published in: Systems \& Control Letters (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1507.07850




Recommendations




Cites Work


Cited In (13)





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)