Value of Information in Greedy Submodular Maximization

07/25/2018
by   David Grimsman, et al.
0

The maximization of submodular functions an NP-Hard problem for certain subclasses of functions, for which a simple greedy algorithm has been shown to guarantee a solution whose quality is within 1/2 of that of the optimal. When this algorithm is implemented in a distributed way, agents sequentially make decisions based on the decisions of all previous agents. This work explores how limited access to the decisions of previous agents affects the quality of the solution of the greedy algorithm. Specifically, we provide tight upper and lower bounds on how well the algorithm performs, as a function of the information available to each agent. Intuitively, the results show that performance roughly degrades proportionally to the size of the largest group of agents which make decisions independently. Additionally, we consider the case where a system designer is given a set of agents and a global limit on the amount of information that can be accessed. Our results show that the best designs are to partition the agents into equally-sized sets, and allow agents to access the decisions of all previous agents within the same set.

READ FULL TEXT

page 7

page 10

research
03/09/2020

Distributed Submodular Maximization with Parallel Execution

The submodular maximization problem is widely applicable in many enginee...
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
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
07/29/2021

Distributed Strategy Selection: A Submodular Set Function Maximization Approach

Constrained submodular set function maximization problems often appear i...
research
10/30/2018

Submodular Maximization Under A Matroid Constraint: Asking more from an old friend, the Greedy Algorithm

The classical problem of maximizing a submodular function under a matroi...
research
03/27/2020

Distributed Beamforming for Agents with Localization Errors

We consider a scenario in which a group of agents aim to collectively tr...
research
09/06/2019

Regression Under Human Assistance

Decisions are increasingly taken by both humans and machine learning mod...

Please sign up or login with your details

Forgot password? Click here to reset