Coverage Games

Abstract

We introduce and study coverage games - a novel framework for multi-agent planning in settings in which a system operates several agents but does not have full control on them, or interacts with an environment that consists of several agents. The game is played between a coverer, who has a set of objectives, and a disruptor. The coverer operates several agents that interact with the adversarial disruptor. The coverer wins if every objective is satisfied by at least one agent. Otherwise, the disruptor wins. Coverage games thus extend traditional two-player games with multiple objectives by allowing a (possibly dynamic) decomposition of the objectives among the different agents. They have many applications, both in settings where the system is the coverer (e.g., multi-robot surveillance, coverage in multi-threaded systems) and settings where it is the disruptor (e.g., prevention of resource exhaustion, ensuring non-congestion). We first study the theoretical properties of coverage games, including determinacy, and the ability to a priori decompose the objectives among the agents. We then study the problems of deciding whether the coverer or the disruptor wins. Besides a comprehensive analysis of the tight complexity of the problems, we consider interesting special cases, such as the one-player cases and settings with a fixed number of agents or objectives.

Figures (7)

• Figure 1: The Büchi CG ${\mathcal{G}}$.
• Figure 2: The game graph $G$.
• Figure 3: An undetermined coverage game.
• Figure 4: The game graph $G$ for $k=2$. Here, $\beta = \{ \alpha_1,\alpha_2,\alpha_3 \}$, with $\alpha_1 = \{ s_2^1,s_3^1,s_1^1 \}$, $\alpha_2 = \{ s_3^2,s_1^1,s_2^1 \}$, and $\alpha_3 = \{ s_1^2,s_2^2,s_3^1 \}$.
• Figure 5: The game graph $G$ for $\Phi = \exists x_1 \forall x_2 \exists x_3 \forall x_4 \phi$.

Theorems & Definitions (56)

• Example 1.1
• Lemma 2.1
• proof
• Theorem 2.2
• proof
• Theorem 2.3
• proof
• Theorem 2.4
• proof
• Theorem 2.5