An asynchronous distributed algorithm for bandit submodular maximization provides approximation guarantees against the centralized optimum, with the suboptimality gap depending explicitly on delays, clock mismatches, and network topology.
Self-configurable mesh-networks for scalable distributed submodular bandit optimization
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Asynchronous Distributed Bandit Submodular Maximization under Heterogeneous Communication Delays
An asynchronous distributed algorithm for bandit submodular maximization provides approximation guarantees against the centralized optimum, with the suboptimality gap depending explicitly on delays, clock mismatches, and network topology.