Optimal Algorithms for Submodular Maximization with Distributed Constraints

09/30/2019
by   Alexander Robey, et al.
22

We consider a class of discrete optimization problems that aim to maximize a submodular objective function subject to a distributed partition matroid constraint. More precisely, we consider a networked scenario in which multiple agents choose actions from local strategy sets with the goal of maximizing a submodular objective function defined over the set of all possible actions. Given this distributed setting, we develop Constraint-Distributed Continuous Greedy (CDCG), a message passing algorithm that converges to the tight (1-1/e) approximation factor of the optimum global solution using only local computation and communication. It is known that a sequential greedy algorithm can only achieve a 1/2 multiplicative approximation of the optimal solution for this class of problems in the distributed setting. Our framework relies on lifting the discrete problem to a continuous domain and developing a consensus algorithm that achieves the tight (1-1/e) approximation guarantee of the global discrete solution once a proper rounding scheme is applied. We also offer empirical results from a multi-agent area coverage problem to show that the proposed method significantly outperforms the state-of-the-art sequential greedy method.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/30/2020

Multi-Agent Maximization of a Monotone Submodular Function via Maximum Consensus

Constrained submodular set function maximization problems often appear i...
research
12/14/2018

Distributed Submodular Minimization over Networks: a Greedy Column Generation Approach

Submodular optimization is a special class of combinatorial optimization...
research
07/29/2021

Distributed Strategy Selection: A Submodular Set Function Maximization Approach

Constrained submodular set function maximization problems often appear i...
research
04/07/2020

The Impact of Message Passing in Agent-Based Submodular Maximization

Submodular maximization problems are a relevant model set for many real-...
research
08/14/2017

A Submodularity-Based Approach for Multi-Agent Optimal Coverage Problems

We consider the optimal coverage problem where a multi-agent network is ...
research
11/02/2021

Execution Order Matters in Greedy Algorithms with Limited Information

In this work, we study the multi-agent decision problem where agents try...
research
09/14/2019

Speeding Up Distributed Pseudo-tree Optimization Procedure with Cross Edge Consistency to Solve DCOPs

Distributed Pseudo-tree Optimization Procedure (DPOP) is a well-known me...

Please sign up or login with your details

Forgot password? Click here to reset