Multiagent Maximum Coverage Problems: The Tradeoff Between Anarchy and Stability

DOI10.1109/TAC.2021.3069809MaRDI QIDQ5092057zbMATH OpenFDO

Authors Vinod Ramaswamy, Dario Paccagnan, Jason R. Marden

Publication date 28 July 2022

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1710.01409

Mathematics Subject Classification ID

Systems theory; control (93-XX)

Cited in

(7)

• Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions
• k-Agent Sufficiency for Multiagent Stochastic Physical Search Problems
• Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router
• Single and Group Agent Migration: Algorithms, Bounds, and Optimality Issues
• Robust networked multiagent optimization: designing agents to repair their own utility functions
• Multiagent Maximum Coverage Problems: The Trade-off Between Anarchy and Stability
• Equilibrium seeking of higher-order networks under facet cover constraints

This page was built for publication: Multiagent Maximum Coverage Problems: The Tradeoff Between Anarchy and Stability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092057)