Distributed resource coordination in networked systems described by digraphs
From MaRDI portal
(Redirected from Publication:899121)
Recommendations
- Distributed optimal resource allocation over strongly connected digraphs: a surplus-based approach
- Distributed average consensus in digraphs
- Distributed optimal in-network resource allocation algorithm design via a control theoretic approach
- Distributed resource allocation on dynamic networks in quadratic time
- Distributed resource allocation via multi-agent systems under time-varying networks
Cites work
- Achieving Proportional Fairness Using Local Information in Aloha Networks
- Consensus and Cooperation in Networked Multi-Agent Systems
- Distributed control of robotic networks: a mathematical approach to motion coordination algorithms.
- Distributed strategies for generating weight-balanced and doubly stochastic digraphs
- Methods for scaling to doubly stochastic form
- Non-negative matrices and Markov chains.
Cited in
(3)- Distributed algorithm for social cost minimization with second-order nonlinear dynamics over weight-unbalanced digraphs
- Distributed predefined-time constrained social cost minimization problem under the partial information setting
- Equilibrium resource distribution in the model of interactions between groups
This page was built for publication: Distributed resource coordination in networked systems described by digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q899121)