Multi-Agent Maximization of a Monotone Submodular Function via Maximum Consensus.
Navid RezazadehSolmaz S. KiaPublished in: CoRR (2020)
Keyphrases
- submodular functions
- multi agent
- greedy algorithm
- objective function
- facility location problem
- combinatorial optimization
- energy function
- convex optimization
- reinforcement learning
- facility location
- worst case
- graph cuts
- learning problems
- machine learning
- neural network
- linear programming
- active learning
- approximation algorithms
- theoretical guarantees
- lower bound
- computational complexity