The Impact of Information in Distributed Submodular Maximization

The maximization of submodular functions is 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 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 that 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 partition the agents into equally sized sets and allow agents to access the decisions of all previous agents within the same set.

[1]  Andreas Krause,et al.  Efficient Planning of Informative Paths for Multiple Robots , 2006, IJCAI.

[2]  Jan Vondrák,et al.  Optimal approximation for the submodular welfare problem in the value oracle model , 2008, STOC.

[3]  Joseph Naor,et al.  A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization , 2015, SIAM J. Comput..

[4]  João Pedro Hespanha,et al.  Impact of information in greedy submodular maximization , 2017, 2017 IEEE 56th Annual Conference on Decision and Control (CDC).

[5]  Na Li,et al.  Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions , 2019, Autom..

[6]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[7]  P. Erdös.  On an extremal problem in graph theory , 1970 .

[8]  Andreas Krause,et al.  Distributed Submodular Maximization: Identifying Representative Elements in Massive Data , 2013, NIPS.

[9]  Pushmeet Kohli,et al.  P³ & Beyond: Move Making Algorithms for Solving Higher Order Functions , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Bahman Gharesifard,et al.  Distributed Submodular Maximization With Limited Information , 2017, IEEE Transactions on Control of Network Systems.

[11]  Hui Lin,et al.  A Class of Submodular Functions for Document Summarization , 2011, ACL.

[12]  Adrian Vetta,et al.  Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[13]  Alexander Schrijver,et al.  A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.

[14]  Yuval Filmus,et al.  The Power of Local Search: Maximum Coverage over a Matroid , 2012, STACS.

[15]  Satoru Iwata,et al.  A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001, JACM.

[16]  Jason R. Marden,et al.  Autonomous Vehicle-Target Assignment: A Game-Theoretical Formulation , 2007 .

[17]  Jason R. Marden.  The Role of Information in Distributed Resource Allocation , 2017, IEEE Transactions on Control of Network Systems.

[18]  Pushmeet Kohli,et al.  On Detection of Multiple Object Instances Using Hough Transforms , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[19]  Andreas Krause,et al.  Simultaneous placement and scheduling of sensors , 2009, 2009 International Conference on Information Processing in Sensor Networks.

[20]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[21]  Jan Vondrák,et al.  Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) , 2007, IPCO.

[22]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[23]  Andreas Krause,et al.  Near-optimal Observation Selection using Submodular Functions , 2007, AAAI.

[24]  Maxim Sviridenko,et al.  A note on maximizing a submodular set function subject to a knapsack constraint , 2004, Oper. Res. Lett..

[25]  Martin Gairing,et al.  Covering Games: Approximation through Non-cooperation , 2009, WINE.

[26]  Michel Minoux,et al.  Accelerated greedy algorithms for maximizing submodular set functions , 1978 .

[27]  Lutz Volkmann.  On perfect and unique maximum independent sets in graphs , 2004 .

[28]  László Lovász,et al.  Submodular functions and convexity , 1982, ISMP.