Abstract
We propose an algorithm for constructing efficient patrolling strategies in the Internet environment, where the protected targets are nodes connected to the network and the patrollers are software agents capable of detecting/preventing undesirable activities on the nodes. The algorithm is based on a novel compositional principle designed for a special class of strategies, and it can quickly construct (sub)optimal solutions even if the number of targets reaches hundreds of millions.
Keywords
- Agent-based and Multi-agent Systems: Multi-agent Planning
- Planning and Scheduling: Distributed;Multi-agent Planning
- Planning and Scheduling: Planning and Scheduling
- Agent-based and Multi-agent Systems: Algorithmic Game Theory
- Agent-based and Multi-agent Systems: Resource Allocation
