Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions
From MaRDI portal
Publication:2280688
DOI10.1016/j.automatica.2019.03.007zbMath1429.93028OpenAlexW2939752533WikidataQ128055408 ScholiaQ128055408MaRDI QIDQ2280688
Publication date: 19 December 2019
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2019.03.007
Related Items
A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness ⋮ Quality of local equilibria in discrete exchange economies ⋮ A mobile multi-agent sensing problem with submodular functions under a partition matroid ⋮ An exact solution approach for the mobile multi‐agent sensing problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- Submodular maximization meets streaming: matchings, matroids, and more
- Auction algorithms for network flow problems: A tutorial introduction
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Combinatorial auctions with decreasing marginal utilities
- Graph Implementations for Nonsmooth Convex Programs
- An analysis of approximations for maximizing submodular set functions—I
- The Role of Information in Distributed Resource Allocation
- Joint Strategy Fictitious Play With Inertia for Potential Games
- Multiagent Maximum Coverage Problems: The Tradeoff Between Anarchy and Stability
- Distributed Welfare Games
- Nonuniform coverage control on the line
- On Optimum Target Assignments
- Truthful randomized mechanisms for combinatorial auctions
- Approximation for maximizing monotone non-decreasing set functions with a greedy method
