Skip to content
Open access

SEAL-MAC: Symmetry-Equivariant Lyapunov Actor–Critic for Queue-Stable MEC Offloading

Aug 2026 · Symmetry · Vol 18, pp. 1311 · 0 citations · 33 references

TL;DR

SEAL-MAC (Symmetry-Equivariant Lyapunov Multi-Agent Actor–Critic), a distributed learning framework that addresses both problems jointly and augments drift-plus-penalty rewards with normalized load-balance signals, coupling queue stability, fairness, and strategic alignment.

Abstract

Mobile edge computing (MEC) must serve rapidly growing populations of latency-critical and energy-constrained devices, yet distributed offloading faces two coupled problems: learned multi-agent policies depend on the arbitrary numerical ordering of edge servers, which wastes training samples and treats physically equivalent configurations inconsistently, while short-horizon cost minimization overloads attractive servers and destabilizes their queues. This paper presents SEAL-MAC (Symmetry-Equivariant Lyapunov Multi-Agent Actor–Critic), a distributed learning framework that addresses both problems jointly. First, a symmetric resource-set actor with a mirror consistency regularizer enforces server relabeling equivariance of each user’s policy and invariance of its value and Lyapunov critics. Second, a load-symmetric Lyapunov–potential shaping mechanism augments drift-plus-penalty rewards with normalized load-balance signals, coupling queue stability, fairness, and strategic alignment. The shaped interaction is analyzed as a Lyapunov-shaped Markov potential game: exact under orthogonal congestion-separable conditions, and a Markov α-potential game under heterogeneity or interference, yielding conditional finite-time (ϵ+α)-Nash convergence and mean-square queue stability. Each device learns from local observations and O(M) queue broadcasts without exchanging gradients or policies. In simulations with up to 200 users, SEAL-MAC reduces average delay by 9.0%, 95th-percentile delay by 11.8%, energy consumption by 10.6%, and the deadline-violation rate from 3.1% to 1.8% relative to the strongest Lyapunov baseline, halves the empirical one-step deviation gain of an identically shaped Ly-PPO agent (0.048 versus 0.098), and raises the Jain fairness index from 0.88 to 0.94.

Read PDF

Similar papers

Preprint Aug 2026

$\texttt{Flip-Team}$: Cooperative Takeover Games with Stochastic Human Override

A cooperative game-theoretic framework for authority switching in shared autonomy is developed, forming the control switching problem as an identical-interest dynamic game in which authority transitions are embedded into the system dynamics, yielding optimal switching policies rather than ad hoc rules.

Sandeep Banik, N. Hovakimyan · 0 citations
Preprint Oct 2026

After Cooperation Is Learned: Gradient Routing and Optimizer-Dependent Maintenance in Multi-Agent Reinforcement Learning

Cooperative MARL is commonly evaluated through cooperation discovery from random initialization, leaving open whether continued optimization can destabilize learned cooperation. Actor-critic comparisons can also conflate critic presence with value gradients entering shared actor representations. We study cooperation ma...

Chao-Yuan Hao, Wen-Tao Yue, Tian-You Lai et al. · 0 citations
#machine learning Preprint Aug 2026

SIGMA: Symmetry-aware, Intelligent, Geometric, Multi-objective Adaptive Control for Robust, Dependable Traffic Management

SIGMA converts natural-language emergency commands into priority vectors for a multi-objective actor-critic controller, avoiding manual reward engineering and offers a reliable, language-guided, multi-objective traffic control system with statistical reliability assurance.

Pratham Payra, B. Jagadish, T. Sen et al. · 0 citations
Sep 2026

A credit-based arbitration mechanism with finite-time fairness guarantees for autonomous multi-agent systems

A lightweight arbitration mechanism that guarantees bounded unfairness for autonomous agents in warehouse logistics and urban unmanned systems is proposed, providing a deterministic finite-time worst-case fairness guarantee that holds for every agent at every moment.

Hanan Solangi · 0 citations
Preprint Sep 2026

Critic-Free Policy Iteration for Continuous-Time Zero-Sum Games: A Policy-Space Riccati Approach

This paper develops a critic-free policy iteration (PI) method for continuous-time linear zero-sum games. The central idea is to characterize the saddle-point policies directly in the joint policy space, rather than treating the quadratic value matrix as an iterative variable. A policy game Riccati equation (PGRE) is i...

Jia-Cheng Wu, Yang Zhu, Hong-Ye Su · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.