TL;DR
This paper introduces the autonomous domination number, a new graph invariant modeling how autonomous agents can defend locations using local information, advancing the understanding of decentralized protection strategies.
Contribution
It proposes the autonomous domination number, a novel graph invariant that captures decentralized defense capabilities of autonomous agents using local protocols.
Findings
Defines the autonomous domination number as a new graph invariant.
Provides initial properties and bounds for the autonomous domination number.
Illustrates potential applications in decentralized security systems.
Abstract
The well-known notion of domination in a graph abstracts the idea of protecting locations with guards. This paper introduces a new graph invariant, the autonomous domination number, which abstracts the idea of defending a collection of locations with autonomous agents following a simple protocol to coordinate their defense using only local information.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs · Optimization and Search Problems