Roman Domination Game (RDG)

• Roman Domination Game (RDG) is a combinatorial optimization framework that applies classical domination theory with game-theoretic and distributed computation principles.
• Nash equilibria in RDG correspond to strong minimal Roman dominating functions, ensuring Pareto-optimal outcomes and robust resource allocation.
• Distributed protocols like GAA, GSA, and EGSA leverage local information to achieve efficient convergence, with proven performance on various graph types.

The Roman Domination Game (RDG) is a combinatorial optimization framework situated at the intersection of classical domination theory, algorithmic game theory, and distributed computation. It formalizes the Roman domination problem—motivated originally by military defense scenarios and now of renewed interest in cybersecurity and redundant resource allocation—as a strategic game. Each vertex of a given graph acts as a rational agent seeking to optimize local payoffs that encode both self-assignment and neighborhood “coverage” costs. Nash equilibria of this game coincide with strong minimal Roman dominating functions and are Pareto-optimal. This structure enables distributed algorithms with provable convergence and efficient, high-quality approximations of optimal Roman domination.

1. Formal Structure of the Roman Domination Game

Let $G=(V, E)$ be a simple graph with $|V|=n$ vertices. Each vertex $v_i \in V$ corresponds to a player in a strategic game $\Gamma = (V, \{S_i\}_{i=1}^n, \{u_i\}_{i=1}^n)$. Here, $S_i = \{0,1,2\}$ denotes player $v_i$’s strategy set, corresponding to assignments in a standard Roman dominating function $f: V \to \{0,1,2\}$.

A profile $C = (c_1,\dots,c_n) \in \Sigma$ ($\Sigma = S_1 \times \dots \times S_n$) fixes the joint assignment. For each vertex $v_i$:

• $|V|=n$0: open neighborhood of $|V|=n$1,
• $|V|=n$2: closed neighborhood,
• $|V|=n$3: vertices within distance $|V|=n$4.

Define $|V|=n$5 if no $|V|=n$6 in $|V|=n$7 adopts strategy $|V|=n$8 (i.e., $|V|=n$9 is “free”/undefended), and $v_i \in V$0 otherwise.

For fixed constants $v_i \in V$1 satisfying $v_i \in V$2, the payoff to player $v_i \in V$3 is: $v_i \in V$4 This model penalizes large assignments and nearby “free” vertices. Best responses and Nash equilibria are defined as usual: $v_i \in V$5 A profile $v_i \in V$6 is a Nash equilibrium (NE) if, for every $v_i \in V$7 and $v_i \in V$8,

$v_i \in V$9

This construction aligns unilateral local rationality with global and local domination objectives (Chen et al., 2023).

2. Game-Theoretic Foundations and Equilibrium Properties

The RDG has a direct correspondence between game-theoretic equilibrium and Roman domination formulations.

• Roman Dominating Function (RDF): $\Gamma = (V, \{S_i\}_{i=1}^n, \{u_i\}_{i=1}^n)$0; every vertex $\Gamma = (V, \{S_i\}_{i=1}^n, \{u_i\}_{i=1}^n)$1 with $\Gamma = (V, \{S_i\}_{i=1}^n, \{u_i\}_{i=1}^n)$2 must have a neighbor $\Gamma = (V, \{S_i\}_{i=1}^n, \{u_i\}_{i=1}^n)$3 with $\Gamma = (V, \{S_i\}_{i=1}^n, \{u_i\}_{i=1}^n)$4.
• Minimal RDF (M-RDF): No single decrement at any vertex produces another RDF.
• Strong Minimal RDF (S-RDF): No local “exchange” of one $\Gamma = (V, \{S_i\}_{i=1}^n, \{u_i\}_{i=1}^n)$5 for multiple $\Gamma = (V, \{S_i\}_{i=1}^n, \{u_i\}_{i=1}^n)$6s in the closed neighborhood strictly decreases total weight.
• Global Minimum RDF (G-RDF): Minimizes $\Gamma = (V, \{S_i\}_{i=1}^n, \{u_i\}_{i=1}^n)$7.

Major theorems:

• Every NE is an RDF (Theorem 2.1): No player can strictly improve utility by covering an uncovered vertex.
• Every NE is an M-RDF (Theorem 2.2): No profitable unilateral decrement exists.
• Every NE coincides with an S-RDF (Theorem 2.3): No profitable local exchange exists.
• Every NE is Pareto-optimal (Theorem 2.4): No strictly dominating joint deviation is possible.

These properties yield the following inclusion hierarchy: $\Gamma = (V, \{S_i\}_{i=1}^n, \{u_i\}_{i=1}^n)$8 This structure ensures that every NE yields a “good” Roman dominating function, and—if global minimality is attained—that NE is also optimally efficient (Chen et al., 2023).

3. Potential Game Formulation and Existence of Equilibria

The RDG is an exact potential game under the potential function: $\Gamma = (V, \{S_i\}_{i=1}^n, \{u_i\}_{i=1}^n)$9 A single-player switch $S_i = \{0,1,2\}$0 yields

$S_i = \{0,1,2\}$1

Implications include:

• Existence of Nash equilibrium.
• Any sequence of strict unilateral improvements terminates at an NE.
• The number of improvement steps is bounded by $S_i = \{0,1,2\}$2, since each gain is lower bounded by a positive constant $S_i = \{0,1,2\}$3 and the potential $S_i = \{0,1,2\}$4 has bounded range $S_i = \{0,1,2\}$5.

This potential-theoretic structure directly enables decentralized solution algorithms and ensures robustness to asynchronous best-response dynamics (Chen et al., 2023).

4. Distributed Algorithms for Roman Domination Game Equilibria

Several distributed protocols are formulated:

Algorithm	Dynamics	Convergence	Features
GAA	Asynchronous	$S_i = \{0,1,2\}$6	Sequential, single best-response
GSA	Synchronous (non-interfering)	$S_i = \{0,1,2\}$7	Parallel, independent acting set
EGSA	Synchronous + Contracts	$S_i = \{0,1,2\}$8	Allows local coalition “contracts”

GAA (Asynchronous): Each $S_i = \{0,1,2\}$9 updates $v_i$0 based on local data ($v_i$1 for $v_i$2). One round comprises $v_i$3 updates; convergence occurs in $v_i$4 rounds.

GSA (Synchronous): Players with positive gain in $v_i$5 act only if they have the minimum index in their 2-hop closed neighborhood $v_i$6. This enforces non-interfering parallelism and guarantees convergence to an NE in $v_i$7 rounds.

EGSA (Enhanced GSA): Introduces occasional “private contracts” among small coalitions. When GSA reaches an NE, eligible white vertices may propose simultaneous local reassignments reducing the total assignment weight. Each contract strictly decreases $v_i$8, and the sequence of contracts plus GSA rounds converges in $v_i$9 steps to an improved S-RDF/NE.

Each protocol exploits only 1–2-hop local information; all steps are fully distributed and robust against local asynchrony (Chen et al., 2023).

5. Computational Results and Benchmarking

Empirical evaluations were performed on several types of random graphs, specifically Barábasi–Albert (BA, $f: V \to \{0,1,2\}$0) and Erdős–Rényi (ER, $f: V \to \{0,1,2\}$1), with experiments averaged over 1,000 instances. Key metrics:

• Weight $f: V \to \{0,1,2\}$2: Sum $f: V \to \{0,1,2\}$3 in the final RDF.
• Rounds: Iterations until convergence.
• Real time ratio $f: V \to \{0,1,2\}$4: Sequential GAA time vs. parallel GSA time.

Summary of findings:

• GSA achieves final weights comparable to GAA but with wall-clock time reduction to only $f: V \to \{0,1,2\}$5–$f: V \to \{0,1,2\}$6 of GAA.
• EGSA further reduces average RDF weight, achieving $f: V \to \{0,1,2\}$7–$f: V \to \{0,1,2\}$8 improvements on ER graphs.
• Multiple (e.g., $f: V \to \{0,1,2\}$9) random-restart runs of GSA sometimes outperform the greedy central algorithm (GA) of Li et al. (2022), the latter being deterministic and non-restartable.
• On BA, GA and GSA($C = (c_1,\dots,c_n) \in \Sigma$0) perform comparably; on ER, GA is nominally better but GSA($C = (c_1,\dots,c_n) \in \Sigma$1) closes the gap.

On tree graphs (random trees RT; BA-tree BAT, $C = (c_1,\dots,c_n) \in \Sigma$2), optimality benchmarks:

• GA: $C = (c_1,\dots,c_n) \in \Sigma$3–$C = (c_1,\dots,c_n) \in \Sigma$4 relative error on RT, $C = (c_1,\dots,c_n) \in \Sigma$5 on BAT.
• GSA: $C = (c_1,\dots,c_n) \in \Sigma$6–$C = (c_1,\dots,c_n) \in \Sigma$7 on RT, $C = (c_1,\dots,c_n) \in \Sigma$8 on BAT.
• GSA($C = (c_1,\dots,c_n) \in \Sigma$9): $\Sigma = S_1 \times \dots \times S_n$0–$\Sigma = S_1 \times \dots \times S_n$1 on RT, $\Sigma = S_1 \times \dots \times S_n$2–$\Sigma = S_1 \times \dots \times S_n$3 on BAT.
• EGSA: $\Sigma = S_1 \times \dots \times S_n$4–$\Sigma = S_1 \times \dots \times S_n$5 on RT, $\Sigma = S_1 \times \dots \times S_n$6–$\Sigma = S_1 \times \dots \times S_n$7 on BAT.

Thus, on tree graphs, EGSA yields solutions within $\Sigma = S_1 \times \dots \times S_n$8–$\Sigma = S_1 \times \dots \times S_n$9 of the optimum (Chen et al., 2023).

6. Connections, Implications, and Extensions

The RDG construction models the minimum Roman domination problem as an exact potential game. Its Nash equilibria are strong minimal Roman dominating functions, guaranteeing Pareto-optimality. Distributed best-response algorithms using only local information efficiently locate such equilibria in general graphs in $v_i$0 rounds. Augmentation via enhanced private contracts (EGSA) raises solution quality, especially in random and tree-like networks, approaching optimality within a small fractional error.

The RDG framework is directly relevant for applications in network resource allocation, defense, and dynamic cyber-physical systems where fully decentralized control and resilience to local disruptions are essential. The methodologies extend classical graph-theoretic notions into algorithmic game theory, offering both deeper insights and scalable, high-performance computational tools (Chen et al., 2023).